{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:48Z","timestamp":1759637988214,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce a generalization of the bisimulation game that finds\ndistinguishing Hennessy-Milner logic formulas from every finitary,\nsubformula-closed language in van Glabbeek's linear-time--branching-time\nspectrum between two finite-state processes. We identify the relevant\ndimensions that measure expressive power to yield formulas belonging to the\ncoarsest distinguishing behavioral preorders and equivalences; the compared\nprocesses are equivalent in each coarser behavioral equivalence from the\nspectrum. We prove that the induced algorithm can determine the best fit of\n(in)equivalences for a pair of processes.<\/jats:p>","DOI":"10.46298\/lmcs-18(3:19)2022","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T07:31:52Z","timestamp":1660721512000},"source":"Crossref","is-referenced-by-count":3,"title":["Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy"],"prefix":"10.46298","volume":"Volume 18, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0637-0171","authenticated-orcid":false,"given":"Benjamin","family":"Bisping","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6636-3301","authenticated-orcid":false,"given":"David N.","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,8,9]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9905\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9905\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:24Z","timestamp":1687292424000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/8541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(3:19)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2109.15295v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2109.15295v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2109.15295","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2109.15295","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,8,9]]},"article-number":"8541"}}