Benjamin Bisping ; David N. Jansen ; Uwe Nestmann - Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy

lmcs:8541 - Logical Methods in Computer Science, August 9, 2022, Volume 18, Issue 3 - https://doi.org/10.46298/lmcs-18(3:19)2022
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy

Authors: Benjamin Bisping ; David N. Jansen ; Uwe Nestmann

    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.


    Volume: Volume 18, Issue 3
    Published on: August 9, 2022
    Accepted on: June 10, 2022
    Submitted on: October 1, 2021
    Keywords: 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

    Share

    Consultation statistics

    This page has been seen 604 times.
    This article's PDF has been downloaded 380 times.