Linear-Time–Branching-Time Spectroscopy Accounting for Silent Steps

05/28/2023

∙

by   Benjamin Bisping, et al.

∙

0

∙

share

We provide the first generalized game characterization of van Glabbeek's linear-time–branching-time spectrum with silent steps. Thereby, one multi-dimensional energy game can be used to decide a wide array of behavioral equivalences between stability-respecting branching bisimiarity and weak trace equivalence in one go. To establish correctness, we relate attacker-winning energy budgets and distinguishing sublanguages of Hennessy–Milner logic characterized by eight dimensions of formula expressiveness. We outline how to derive exponential-time algorithms and divergence-preserving variants.