License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2020.26
URN: urn:nbn:de:0030-drops-116698
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11669/
Kupke, Clemens ;
Rot, Jurriaan
Expressive Logics for Coinductive Predicates
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.
BibTeX - Entry
@InProceedings{kupke_et_al:LIPIcs:2020:11669,
author = {Clemens Kupke and Jurriaan Rot},
title = {{Expressive Logics for Coinductive Predicates}},
booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)},
pages = {26:1--26:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-132-0},
ISSN = {1868-8969},
year = {2020},
volume = {152},
editor = {Maribel Fern{\'a}ndez and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11669},
URN = {urn:nbn:de:0030-drops-116698},
doi = {10.4230/LIPIcs.CSL.2020.26},
annote = {Keywords: Coalgebra, Fibration, Modal Logic}
}
|
Keywords: |
|
Coalgebra, Fibration, Modal Logic |
|
Collection: |
|
28th EACSL Annual Conference on Computer Science Logic (CSL 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
06.01.2020 |
