Expressive logics for coinductive predicates
Kupke, Clemens and Rot, Jurriaan (2021) Expressive logics for coinductive predicates. Logical Methods in Computer Science. ISSN 1860-5974 (In Press)
Preview |
Text.
Filename: Kupke_etal_LMCS_2021_Expressive_logics_for_coinductive_predicates.pdf
Accepted Author Manuscript License: Download (509kB)| 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.
-
-
Item type: Article ID code: 77576 Dates: DateEvent15 July 2021Published15 July 2021AcceptedSubjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 26 Aug 2021 14:08 Last modified: 01 Sep 2024 01:31 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/77576