Modal Logics for Nominal Transition Systems

04/04/2019
by   Joachim Parrow, et al.
0

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for these systems is introduced, and proved adequate and expressively complete for bisimulation equivalence. A main technical novelty is the use of finitely supported infinite conjunctions. We show how to treat different bisimulation variants such as early, late, open and weak in a systematic way, explore the folklore theorem that state predicates can be replaced by actions, and make substantial comparisons with related work. The main definitions and theorems have been formalised in Nominal Isabelle.

READ FULL TEXT
research
08/21/2020

Logic-Induced Bisimulations

We define a new logic-induced notion of bisimulation (called ρ-bisimulat...
research
06/22/2020

Expressive Logics for Coinductive Predicates

The classical Hennessy-Milner theorem says that two states of an image-f...
research
05/10/2018

When Names Are Not Commonly Known: Epistemic Logic with Assignments

In standard epistemic logic, agent names are usually assumed to be commo...
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
10/10/2018

A van Benthem Theorem for Quantitative Probabilistic Modal Logic

In probabilistic transition systems, behavioural metrics provide a more ...
research
09/24/2019

A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems

Branching bisimilarity is a behavioural equivalence relation on labelled...
research
09/10/2018

The Power of the Weak

A landmark result in the study of logics for formal verification is Jani...

Please sign up or login with your details

Forgot password? Click here to reset