Expressive logics for coinductive predicates

Kupke, Clemens and Rot, Jurriaan; Fernandez, Maribel and Muscholl, Anca, eds. (2020) Expressive logics for coinductive predicates. In: 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, ESP, 26:1--26:18. ISBN 9783959771320 (https://doi.org/10.4230/LIPIcs.CSL.2020.26)

Preview

Text. Filename: Kupke_Rot_CSL_2020_Expressive_logics_for_coinductive.pdf Final Published Version License: Download (541kB)| Preview

Abstract

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give sufficient conditions on the semantics. The approach is illustrated with logics characterising similarity, divergence and a behavioural metric on automata.

• Share and Export
  

  ASCII CitationEP3 XMLRIS (EndNote Online, Zotero, Ref manager, etc)HTML CitationOpenURL ContextObject in SpanRIOXX2 XMLRDF+N-TriplesBibTeXMPEG-21 DIDLMODSRefWorksRDF+N3Multiline CSVJSONDublin CoreData Cite XMLSimple MetadataEndNoteAtomMETSOpenURL ContextObjectRDF+XMLRefer
• Item metadata

  Item type:	Book Section
  ID code:	70789
  Dates:	Date Event 16 January 2020 Published 30 September 2019 Accepted
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	11 Dec 2019 11:53
  Last modified:	12 Dec 2024 01:26
  URI:	https://strathprints.strath.ac.uk/id/eprint/70789