Explaining Non-Bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas

by   Barbara König, et al.

Behavioural equivalences can be characterized via bisimulation, modal logics, and spoiler-duplicator games. In this paper we work in the general setting of coalgebra and focus on generic algorithms for computing the winning strategies of both players in a bisimulation game. The winning strategy of the spoiler (if it exists) is then transformed into a modal formula that distinguishes the given non-bisimilar states. The modalities required for the formula are also synthesized on-the-fly, and we present a recipe for re-coding the formula with different modalities, given a separating set of predicate liftings. Both the game and the generation of the distinguishing formulas have been implemented in a tool called T-BEG.


page 1

page 2

page 3

page 4


About the unification type of simple symmetric modal logics

The unification problem in a normal modal logic is to determine, given a...

Formula size games for modal logic and μ-calculus

We propose a new version of formula size game for modal logic. The game ...

Deciding All Behavioral Equivalences at Once: A Game for Linear-time–Branching-time Spectroscopy

We introduce a generalization of the bisimulation game that can be emplo...

Characterising Modal Formulas with Examples

We initiate the study of finite characterizations and exact learnability...

About the unification types of the modal logics determined by classes of deterministic frames

The unification problem in a propositional logic is to determine, given ...

Size matters in the modal μ-calculus

We discuss and compare complexity measures for the modal μ-calculus, foc...