Expressive logics for coinductive predicates

Clemens Kupke, Jurriaan Rot

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

3 Citations (Scopus)
14 Downloads (Pure)

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.
Original languageEnglish
Title of host publication28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
EditorsMaribel Fernandez, Anca Muscholl
Place of PublicationDagstuhl, Germany
Pages26:1--26:18
Number of pages18
Volume152
DOIs
Publication statusPublished - 16 Jan 2020
EventComputer Science Logic - Barcelona, Spain
Duration: 13 Jan 202016 Jan 2020
https://www.cs.upc.edu/csl2020/

Conference

ConferenceComputer Science Logic
Abbreviated titleCSL 2020
Country/TerritorySpain
CityBarcelona
Period13/01/2016/01/20
Internet address

Keywords

  • coalgebra
  • fibration
  • modal logic

Fingerprint

Dive into the research topics of 'Expressive logics for coinductive predicates'. Together they form a unique fingerprint.

Cite this