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)

[thumbnail of Kupke-Rot-CSL-2020-Expressive-logics-for-coinductive]
Preview
 Text. Filename: Kupke_Rot_CSL_2020_Expressive_logics_for_coinductive.pdf
Final Published Version
License: Creative Commons Attribution 3.0 logo
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.

CORE (COnnecting REpositories)