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

We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state processes. We identify the relevant dimensions that mea...

Full description

Saved in:
Bibliographic Details
Published inLogical methods in computer science Vol. 18, Issue 3
Main Authors Bisping, Benjamin, Jansen, David N., Nestmann, Uwe
Format Journal Article
LanguageEnglish
Published Logical Methods in Computer Science e.V 09.08.2022
Subjects
computer science - computer science and game theory
computer science - formal languages and automata theory
computer science - logic in computer science
f.2.2
f.4.1
Online AccessGet full text

Cover

More Information
Summary:We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state processes. We identify the relevant dimensions that measure expressive power to yield formulas belonging to the coarsest distinguishing behavioral preorders and equivalences; the compared processes are equivalent in each coarser behavioral equivalence from the spectrum. We prove that the induced algorithm can determine the best fit of (in)equivalences for a pair of processes.
ISSN:1860-5974
1860-5974
DOI:10.46298/lmcs-18(3:19)2022