{"docId":9905,"paperId":8541,"url":"https:\/\/lmcs.episciences.org\/8541","doi":"10.46298\/lmcs-18(3:19)2022","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":657,"name":"Volume 18, Issue 3"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"2109.15295","repositoryVersion":6,"repositoryLink":"https:\/\/arxiv.org\/abs\/2109.15295v6","dateSubmitted":"2021-10-01 13:18:13","dateAccepted":"2022-06-10 10:28:20","datePublished":"2022-08-09 14:13:29","titles":["Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy"],"authors":["Bisping, Benjamin","Jansen, David N.","Nestmann, Uwe"],"abstracts":["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."],"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"]}