A Game for Linear-time–Branching-time Spectroscopy

@article{Bisping2021AGF,
  title={A Game for Linear-time–Branching-time Spectroscopy},
  author={Benjamin Bisping and Uwe Nestmann},
  journal={Tools and Algorithms for the Construction and Analysis of Systems},
  year={2021},
  volume={12651},
  pages={3 - 19}
}
We introduce a generalization of the bisimulation game that can be employed to find all relevant distinguishing Hennessy–Milner logic formulas for two compared finite-state processes. By measuring the use of expressive powers, we adapt the formula generation to just yield formulas belonging to the coarsest distinguishing behavioral preorders/equivalences from the linear-time–branching-time spectrum. The induced algorithm can determine the best fit of (in)equivalences for a pair of processes. 
[PDF] Semantic Reader
2 Citations
Highly Influential Citations
1
Background Citations
2
Methods Citations
2

2 Citations

A Game Characterization for Contrasimilarity

The first game characterization of the contrasimulation preorder is given and it is proved its correctness to be the last puzzle piece to have game characterizations for the whole linear-time–branching-time spectrum with internal steps.

Process Equivalence Problems as Energy Games

All common notions of behavioral equivalence are characterized by one 6-dimensional energy game, where energies bound capabilities of an attacker trying to tell processes apart are defined.

References

SHOWING 1-10 OF 38 REFERENCES

Computing Distinguishing Formulas for Branching Bisimulation

An algorithm which, given two branching bisimulation inequivalent finite state processes, produces a distinguishing formula in Hennessy-Milner logic extended with an ‘until’ operator that provides a useful extension to the algorithm for deciding equivalence.

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

This paper focuses on generic algorithms for computing the winning strategies of both players in a bisimulation game and generates a modal formula that distinguishes the given non-bisimilar states.

Games for Bisimulations and Abstraction

This paper provides a generic characterisation of branching-, delayed-, $\eta$- and weak-bisimulation as a game between Spoiler and Duplicator, offering an operational understanding of the relations.

The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves

This paper provides a parameterized deenition of a such a preorder, such that most such pre-orders and equivalences found in the literature are obtained by a suitable instantiation of the parameters.

The Linear Time - Branching Time Spectrum II

This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time…

The Linear Time-Branching Time Spectrum (Extended Abstract)

Testing equivalence as a bisimulation equivalence

This paper shows how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalence and prebisimulation preorders and uses algorithms for determining the (pre)bisimulations relations in the case of finite-state transition systems.

A Game Characterization for Contrasimilarity

The first game characterization of the contrasimulation preorder is given and it is proved its correctness to be the last puzzle piece to have game characterizations for the whole linear-time–branching-time spectrum with internal steps.

The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR

In this paper various semantics in the linear time { branching time spectrum are presented in a uniform, model-independent way and the classiication of some useful process semantics can be facilitated by drawing parts of this lattice and locating the positions of some interesting process semantics, found in the literature.

On Automatically Explaining Bisimulation Inequivalence

The method works in conjunction with a partition-refinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal in a precisely defined sense.