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

09/30/2021

∙

by   Benjamin Bisping, et al.

∙

0

∙

share

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.