{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:15:09Z","timestamp":1760080509420,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720155"},{"type":"electronic","value":"9783030720162"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:00:00Z","timestamp":1616198400000},"content-version":"vor","delay-in-days":78,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a generalization of the bisimulation game that can be employed to find all relevant distinguishing Hennessy\u2013Milner 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\u2013branching-time spectrum. The induced algorithm can determine the best fit of (in)equivalences for a pair of processes.<\/jats:p>","DOI":"10.1007\/978-3-030-72016-2_1","type":"book-chapter","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T22:03:37Z","timestamp":1616191417000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Game for Linear-time\u2013Branching-time Spectroscopy"],"prefix":"10.1007","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-8520-5448","authenticated-orcid":false,"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,20]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Bisping, B.: Linear-time\u2013branching-time spectroscope: TACAS 2021 edition (2021). https:\/\/doi.org\/10.5281\/zenodo.4475878, archived on Zenodo","key":"1_CR1","DOI":"10.5281\/zenodo.4475878"},{"doi-asserted-by":"publisher","unstructured":"Bisping, B., Nestmann, U.: Computing coupled similarity. In: Proceedings of TACAS. pp. 244\u2013261. LNCS, Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_14","key":"1_CR2","DOI":"10.1007\/978-3-030-17462-0_14"},{"doi-asserted-by":"publisher","unstructured":"Bisping, B., Nestmann, U., Peters, K.: Coupled similarity: the first 32 years. Acta Informatica 57(3-5), 439\u2013463 (2020). https:\/\/doi.org\/10.1007\/s00236-019-00356-4","key":"1_CR3","DOI":"10.1007\/s00236-019-00356-4"},{"doi-asserted-by":"publisher","unstructured":"Chen, X., Deng, Y.: Game characterizations of process equivalences. In: Ramalingam, G. (ed.) Programming Languages and Systems. pp. 107\u2013121. Springer Berlin Heidelberg, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89330-1_8","key":"1_CR4","DOI":"10.1007\/978-3-540-89330-1_8"},{"doi-asserted-by":"publisher","unstructured":"Cleaveland, R.: On automatically explaining bisimulation inequivalence. In: Clarke, E.M., Kurshan, R.P. (eds.) Computer-Aided Verification. pp. 364\u2013372. Springer Berlin Heidelberg, Berlin, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0023750","key":"1_CR5","DOI":"10.1007\/BFb0023750"},{"doi-asserted-by":"publisher","unstructured":"Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5(1), 1\u201320 (1993). https:\/\/doi.org\/10.1007\/BF01211314","key":"1_CR6","DOI":"10.1007\/BF01211314"},{"doi-asserted-by":"publisher","unstructured":"D. Bruda, S., Zhang, Z.: Model checking is refinement \u2013 from computation tree logic to failure trace testing. In: Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,. pp. 173\u2013178. INSTICC, SciTePress (2010). https:\/\/doi.org\/10.5220\/0003006801730178","key":"1_CR7","DOI":"10.5220\/0003006801730178"},{"doi-asserted-by":"publisher","unstructured":"de\u00a0Frutos-Escrig, D., Keiren, J.J.A., Willemse, T.A.C.: Games for bisimulations and abstraction. Logical Methods in Computer Science 13(4) (Nov 2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:15)2017","key":"1_CR8","DOI":"10.23638\/LMCS-13(4:15)2017"},{"doi-asserted-by":"publisher","unstructured":"Gazda, M., Fokkink, W., Massaro, V.: Congruence from the operator\u2019s point of view: Syntactic requirements on modal characterizations. Acta Informatica 57(3-5), 329\u2013351 (10 2020). https:\/\/doi.org\/10.1007\/s00236-019-00355-5","key":"1_CR9","DOI":"10.1007\/s00236-019-00355-5"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The linear time\u2013branching time spectrum. In: International Conference on Concurrency Theory. pp. 278\u2013297. Springer (1990). https:\/\/doi.org\/10.1007\/BFb0039066","key":"1_CR10","DOI":"10.1007\/BFb0039066"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The linear time\u2013branching time spectrum II. In: International Conference on Concurrency Theory. pp. 66\u201381. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6","key":"1_CR11","DOI":"10.1007\/3-540-57208-2_6"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The linear time\u2013branching time spectrum I \u2013 the semantics of concrete, sequential processes. In: Handbook of Process Algebra. pp. 3\u201399. Elsevier, Amsterdam (2001). https:\/\/doi.org\/10.1016\/B978-044482830-9\/50019-9","key":"1_CR12","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E.: Finite model theory and descriptive complexity. In: Gr\u00e4del, E., Kolaitis, P., Libkin, L., Marx, M., Spencer, J., Vardi, M., Venema, Y., Weinstein, S. (eds.) Finite Model Theory and Its Applications, pp. 125\u2013230. Texts in Theoretical Computer Science. An EATCS Series, Springer Berlin Heidelberg (2007). https:\/\/doi.org\/10.1007\/3-540-68804-8_3","key":"1_CR13","DOI":"10.1007\/3-540-68804-8_3"},{"doi-asserted-by":"publisher","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de\u00a0Bakker, J., van Leeuwen, J. (eds.) Automata, Languages and Programming. pp. 299\u2013309. Springer Berlin Heidelberg, Berlin, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_79","key":"1_CR14","DOI":"10.1007\/3-540-10003-2_79"},{"doi-asserted-by":"publisher","unstructured":"Jasper, M., Schl\u00fcter, M., Steffen, B.: Characteristic invariants in Hennessy\u2013Milner logic. Acta Informatica pp. 671\u2013687 (2020). https:\/\/doi.org\/10.1007\/s00236-020-00376-5","key":"1_CR15","DOI":"10.1007\/s00236-020-00376-5"},{"doi-asserted-by":"publisher","unstructured":"K\u00f6nig, B., Mika-Michalski, C., Schr\u00f6der, L.: Explaining non-bisimilarity in a coalgebraic approach: Games and distinguishing formulas. In: Petri\u015fan, D., Rot, J. (eds.) Coalgebraic Methods in Computer Science. pp. 133\u2013154. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57201-3_8","key":"1_CR16","DOI":"10.1007\/978-3-030-57201-3_8"},{"doi-asserted-by":"publisher","unstructured":"Ku\u010dera, A., Esparza, J.: A logical viewpoint on process-algebraic quotients. In: Flum, J., Rodriguez-Artalejo, M. (eds.) Computer Science Logic. pp. 499\u2013514. Springer Berlin Heidelberg, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48168-0_35","key":"1_CR17","DOI":"10.1007\/3-540-48168-0_35"},{"doi-asserted-by":"publisher","unstructured":"Shukla, S.K., Hunt, H.B., Rosenkrantz, D.J.: HORNSAT, model checking, verification and games (1995). https:\/\/doi.org\/10.1007\/3-540-61474-5_61","key":"1_CR18","DOI":"10.1007\/3-540-61474-5_61"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72016-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T00:04:07Z","timestamp":1616371447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72016-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720155","9783030720162"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72016-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"141","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference changed to an online format due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}