Hennessy-Milner Theorems via Galois Connections

07/12/2022
by   Harsh Beohar, et al.
0

We introduce a general and compositional, yet simple, framework that allows us to derive soundness and expressiveness results for modal logics characterizing behavioural equivalences or metrics (also known as Hennessy-Milner theorems). It is based on Galois connections between sets of (real-valued) predicates on the one hand and equivalence relations/metrics on the other hand and covers a part of the linear-time-branching-time spectrum, both for the qualitative case (behavioural equivalences) and the quantitative case (behavioural metrics). We derive behaviour functions from a given logic and give a condition, called compatibility, that characterizes under which conditions a logically induced equivalence/metric is induced by a fixpoint equation. In particular this framework allows us to derive a new fixpoint characterization of directed trace metrics.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 9

page 11

page 15

research
06/02/2023

Quantitative Graded Semantics and Spectra of Behavioural Metrics

Behavioural metrics provide a quantitative refinement of classical two-v...
research
01/29/2019

Representation theorems for extended contact algebras based on equivalence relations

The aim of this paper is to give new representation theorems for extende...
research
12/04/2018

Graded Monads for the Linear Time - Branching Time Spectrum

State-based models of concurrent systems are traditionally considered un...
research
07/02/2020

Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions

Behavioural distances provide a fine-grained measure of equivalence in s...
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
07/22/2019

Codensity Games for Bisimilarity

Bisimilarity as an equivalence notion of systems has been central to pro...
research
05/21/2021

Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation

A modal logic that is strong enough to fully characterize the behavior o...

Please sign up or login with your details

Forgot password? Click here to reset