Expressive Logics for Coinductive Predicates

06/22/2020
by   Clemens Kupke, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2018

A van Benthem Theorem for Quantitative Probabilistic Modal Logic

In probabilistic transition systems, behavioural metrics provide a more ...
research
04/14/2022

A van Benthem Theorem for Atomic and Molecular Logics

After recalling the definitions of atomic and molecular logics, we show ...
research
07/19/2022

Quantitative Hennessy-Milner Theorems via Notions of Density

The classical Hennessy-Milner theorem is an important tool in the analys...
research
07/27/2023

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras

Coalgebra, as the abstract study of state-based systems, comes naturally...
research
04/04/2019

Modal Logics for Nominal Transition Systems

We define a general notion of transition system where states and action ...
research
09/11/2018

Dynamic logic assigned to automata

A dynamic logic B can be assigned to every automaton A without regard ...
research
08/19/2019

Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence

In two earlier papers we derived congruence formats with regard to trans...

Please sign up or login with your details

Forgot password? Click here to reset