{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:02:54Z","timestamp":1769979774187,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3-5","license":[{"start":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T00:00:00Z","timestamp":1574899200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T00:00:00Z","timestamp":1574899200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00236-019-00356-4","type":"journal-article","created":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T16:02:46Z","timestamp":1574956966000},"page":"439-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Coupled similarity: the first 32 years"],"prefix":"10.1007","volume":"57","author":[{"given":"Benjamin","family":"Bisping","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4281-0074","authenticated-orcid":false,"given":"Kirstin","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"1","key":"356_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1996.0047","volume":"127","author":"L Aceto","year":"1996","unstructured":"Aceto, L., van Glabbeek, R., Fokkink, W., Ing\u00f3lfsd\u00f3ttir, A.: Axiomatizing prefix iteration with silent steps. Inf. Comput. 127(1), 26\u201340 (1996)","journal-title":"Inf. Comput."},{"key":"356_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-39993-3_4","volume-title":"From Object-Orientation to Formal Methods. Essays in Memory of Ole-Johan Dahl, LNCS","author":"G Agha","year":"2004","unstructured":"Agha, G., Thati, P.: An algebraic theory of actors and its application to a simple object-based language. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. Essays in Memory of Ole-Johan Dahl, LNCS, vol. 2635, pp. 26\u201357. Springer, Berlin (2004)"},{"issue":"2","key":"356_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"RM Amadio","year":"1998","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous $$\\pi $$-calculus. Theor. Comput. Sci. 195(2), 291\u2013324 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"356_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.07.036","volume":"335","author":"JCM Baeten","year":"2005","unstructured":"Baeten, J.C.M.: A brief history of process algebra. Theor. Comput. Sci. 335(2\u20133), 131\u2013146 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.07.036","journal-title":"Theor. Comput. Sci."},{"key":"356_CR5","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Fernandez, J.C., Graf, S., Rodriguez, C., Sifakis, J.: Safety for branching time semantics. In: Albert, J.L. (Hrsg.), Monien, B. (Hrsg.), Rodr\u00edguez-Artalejo, M. (Hrsg.) (eds.) Proceedings of ICALP, LNCS, vol.\u00a0510, pp. 76\u201392. Springer (1991)","DOI":"10.1007\/3-540-54233-7_126"},{"issue":"3","key":"356_CR6","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"356_CR7","unstructured":"Bisping, B.: Computing coupled similarity. Technische Universit\u00e4t Berlin, Diplomarbeit (2018). https:\/\/coupledsim.bbisping.de\/bisping_computingCoupledSimilarity_thesis.pdf. Accessed 15 Nov 2019"},{"key":"356_CR8","unstructured":"Bisping, B.: Isabelle\/HOL proof and apache flink program for TACAS 2019 paper: computing coupled similarity. Figshare 3 (2019). https:\/\/doi.org\/10.6084\/m9.figshare.7831382.v1"},{"key":"356_CR9","doi-asserted-by":"crossref","unstructured":"Bisping, B., Nestmann, U.: Computing coupled similarity. In: Proceedings of TACAS, LNCS, pp. 244\u2013261. Springer (2019)","DOI":"10.1007\/978-3-030-17462-0_14"},{"key":"356_CR10","unstructured":"Boudol, G.: Asynchrony and the $$\\pi $$-calculus (Note)\/INRIA Sophia-Antipolis version (1992). https:\/\/hal.inria.fr\/inria-00076939\/document. 1992 (1702). Rapport de Recherche"},{"key":"356_CR11","doi-asserted-by":"crossref","unstructured":"Brookes, S.D.: On the relationship of CCS and CSP. In: Proceedings of ICALP, LNCS, pp. 83\u201396. Springer (1983)","DOI":"10.1007\/BFb0036899"},{"key":"356_CR12","unstructured":"Derrick, J., Dongol, B., Schellhorn, G., Tofan, B., Travkin, O., Wehrheim, H.: Quiescent consistency: defining and verifying relaxed linearizability. In: FM 2014: Formal Methods-19th International Symposium, Singapore, May 12\u201316 2014, Proceedings. Lecture Notes in Computer Science, vol. 8442, pp. 200\u2013214. Springer (2014). ISBN 978-3-319-06409-3"},{"key":"356_CR13","first-page":"207","volume":"93","author":"Y Deng","year":"2007","unstructured":"Deng, Y.: A simple completeness proof for the axiomatisations of weak behavioural equivalences. Bull. EATCS 93, 207\u2013219 (2007)","journal-title":"Bull. EATCS"},{"key":"356_CR14","doi-asserted-by":"crossref","unstructured":"Derrick, J., Wehrheim, H.: Using coupled simulations in non-atomic refinement. In: International Conference of B and Z Users, LNCS, vol. 2651, pp. 127\u2013147. Springer (2003)","DOI":"10.1007\/3-540-44880-2_10"},{"key":"356_CR15","doi-asserted-by":"crossref","unstructured":"Dsouza, A., Bloom, B.: On the expressive power of CCS. In: Proceedings of FSTTCS, LNCS, pp. 309\u2013323. Springer (1995)","DOI":"10.1007\/3-540-60692-0_57"},{"key":"356_CR16","doi-asserted-by":"crossref","unstructured":"Evrard, H., Lang, F.: Formal verification of distributed branching multiway synchronisation protocols. In: Proceedings of FMOODS\/FORTE, pp. 146\u2013160. Springer (2013)","DOI":"10.1007\/978-3-642-38592-6_11"},{"key":"356_CR17","unstructured":"Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Steele, Jr. G. (Hrsg.), ACM (Veranst.) Proceedings of POPL \u201996 ACM, pp. 372\u2013385. Springer (1996)"},{"key":"356_CR18","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gonthier, G.: The join calculus: a language for distributed mobile programming. In: Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, Sep 9\u201315 2000, Advanced Lectures (LNCS), vol. 2395, pp. 268\u2013332. Springer (2002)","DOI":"10.1007\/3-540-45699-6_6"},{"issue":"1","key":"356_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C Fournet","year":"2005","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. J. Log. Algebr. Program. 63(1), 131\u2013173 (2005)","journal-title":"J. Log. Algebr. Program."},{"issue":"11\u201313","key":"356_CR20","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.tcs.2009.11.011","volume":"411","author":"Y Fu","year":"2010","unstructured":"Fu, Y., Lu, H.: On the expressiveness of interaction. Theor. Comput. Sci. 411(11\u201313), 1387\u20131451 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2009.11.011","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"356_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","volume":"15","author":"H Garavel","year":"2013","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. Int. J. Softw. Tool Technol. Transf. 15(2), 89\u2013107 (2013)","journal-title":"Int. J. Softw. Tool Technol. Transf."},{"key":"356_CR22","unstructured":"Garavel, H., Lang, F., Serwe, W.: From LOTOS to LNT. In: Katoen, J.-P. (Hrsg.), Langerak, R. (Hrsg.), Rensink, A. (Hrsg.) ModelEd, TestEd, TrustEd\u2014Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, vol. 10500, pp. 3\u201326. Springer (2017). ISBN 978-3-319-68269-3"},{"issue":"4","key":"356_CR23","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1017\/S0960129514000279","volume":"26","author":"D Gorla","year":"2016","unstructured":"Gorla, D., Nestmann, U.: Full abstraction for expressiveness: history, myths and facts. Math. Struct. Comput. Sci. 26(4), 639\u2013654 (2016). https:\/\/doi.org\/10.1017\/S0960129514000279","journal-title":"Math. Struct. Comput. Sci."},{"issue":"9","key":"356_CR24","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","journal-title":"Inf. Comput."},{"key":"356_CR25","doi-asserted-by":"publisher","unstructured":"Gorrieri, R., Rensink, A.: Action refinement. Version: 2001. In: Bergstra, J.A. (Hrsg.), Ponse, A. (Hrsg.), Smolka, S.A. (Hrsg.) Handbook of Process Algebra, pp. 1047\u20131147. North-Holland\/Elsevier (2001). https:\/\/doi.org\/10.1016\/b978-044482830-9\/50034-5. ISBN 978-0-444-82830-9","DOI":"10.1016\/b978-044482830-9\/50034-5"},{"key":"356_CR26","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J.: A branching time model of CSP. Version: 2017. In: Gibson-Robinson, T. (Hrsg.), Hopcroft, P. (Hrsg.), Lazi\u0107, R. (Hrsg.) Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday, pp. 272\u2013293. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51046-0_14. ISBN 978-3-319-51046-0","DOI":"10.1007\/978-3-319-51046-0_14"},{"key":"356_CR27","doi-asserted-by":"crossref","unstructured":"Glabbeek, R.J.: The linear time-branching time spectrum II. In: International Conference on Concurrency Theory, pp. 66\u201381. Springer (1993)","DOI":"10.1007\/3-540-57208-2_6"},{"issue":"4\/5","key":"356_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"RJ Glabbeek","year":"2001","unstructured":"Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Inf. 37(4\/5), 229\u2013327 (2001). https:\/\/doi.org\/10.1007\/s002360000041","journal-title":"Acta Inf."},{"issue":"3","key":"356_CR29","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ Glabbeek","year":"1996","unstructured":"Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996). https:\/\/doi.org\/10.1145\/233551.233556","journal-title":"J. ACM"},{"key":"356_CR30","unstructured":"Hatzel, M., Wagner, C., Peters, K., Nestmann, U.: Encoding CSP into CCS. In: Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, EXPRESS\/SOS, pp. 61\u201375 (2015)"},{"key":"356_CR31","doi-asserted-by":"crossref","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: Tokoro, M. (Hrsg.), Nierstrasz, O. (Hrsg.), Wegner, P. (Hrsg.) Object-Based Concurrent Computing 1991, LNCS, vol. 612, pp. 133\u2013147. Springer (1992)","DOI":"10.1007\/BFb0057019"},{"issue":"5","key":"356_CR32","first-page":"475","volume":"12","author":"F Knabe","year":"1993","unstructured":"Knabe, F.: A distributed protocol for channel-based communication with choice. Comput. Artif. Intell. 12(5), 475\u2013490 (1993)","journal-title":"Comput. Artif. Intell."},{"issue":"5","key":"356_CR33","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1017\/S0960129504004323","volume":"14","author":"M Merro","year":"2004","unstructured":"Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi. Math. Struct. Comput. Sci. 14(5), 715\u2013767 (2004). https:\/\/doi.org\/10.1017\/S0960129504004323","journal-title":"Math. Struct. Comput. Sci."},{"key":"356_CR34","unstructured":"Milner, R.: Process constructors and interpretations. IFIP Congress (Invited Paper), pp. 507\u2013514 (1986)"},{"key":"356_CR35","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"key":"356_CR36","unstructured":"Milner, R.: Skew bisimilarity, June (1995). Personal Communication"},{"key":"356_CR37","unstructured":"Mitchell, K.: Implementations of process synchronisation and their Analysis. LFCS, University of Edinburgh, Dissertation, July (1986)"},{"issue":"1","key":"356_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2868","volume":"163","author":"U Nestmann","year":"2000","unstructured":"Nestmann, U., Pierce, B.C.: Decoding choice encodings. Inf. Comput. 163(1), 1\u201359 (2000). https:\/\/doi.org\/10.1006\/inco.2000.2868","journal-title":"Inf. Comput."},{"key":"356_CR39","unstructured":"Parrow, J., Sj\u00f6din, P.: The complete axiomatization of cs-congruence. In: Enjalbert, P. (Hrsg.), Mayr, E.W. (Hrsg.), Wagner, K.W. (Hrsg.) STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, Feb 24\u201326, 1994 Proceedings, pp. 555\u2013568. Springer, Berlin (1994). ISBN 978-3-540-48332\u20138"},{"key":"356_CR40","unstructured":"Parrow, J., Sj\u00f6din, P.: Multiway synchronization verified with coupled simulation. In: Cleaveland, W.R. (Hrsg.) CONCUR \u201992: Third International Conference on Concurrency Theory Stony Brook, NY, USA, Aug 24\u201327, 1992 Proceedings, pp. 518-533. Springer, Berlin (1992). ISBN 978-3-540-47293-3"},{"issue":"4","key":"356_CR41","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1017\/S0960129514000280","volume":"26","author":"J Parrow","year":"2016","unstructured":"Parrow, J.: General conditions for full abstraction. Math. Struct. Comput. Sci. 26(4), 655\u2013657 (2016). https:\/\/doi.org\/10.1017\/S0960129514000280","journal-title":"Math. Struct. Comput. Sci."},{"key":"356_CR42","unstructured":"Peters, K.: Translational expressiveness. TU Berlin, Dissertation (2012). http:\/\/opus.kobv.de\/tuberlin\/volltexte\/2012\/3749\/. Accessed 15 Nov 2019"},{"key":"356_CR43","unstructured":"Peters, K., Glabbeek, R.J.: Analysing and comparing encodability criteria. In: Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, EXPRESS\/SOS, pp. 46\u201360 (2015)"},{"key":"356_CR44","doi-asserted-by":"crossref","unstructured":"Peters, K., van Glabbeek, R.: Analysing and comparing encodability criteria for process calculi. In: Archive of Formal Proofs. http:\/\/isa-afp.org\/entries\/Encodability_Process_Calculi.shtml. Formal Proof Development of the Theories Described in the Workshop Paper. Analysing and Comparing Encodability Criteria (2015). Accessed 15 Nov 2019","DOI":"10.4204\/EPTCS.190.4"},{"key":"356_CR45","doi-asserted-by":"crossref","unstructured":"Peters, K., Nestmann, U., Goltz, U.: On distributability in process calculi. In: Proceedings of ESOP, LNCS, vol. 7792, pp. 310\u2013329. Springer (2013)","DOI":"10.1007\/978-3-642-37036-6_18"},{"key":"356_CR46","doi-asserted-by":"crossref","unstructured":"Pierce, B.C., Turner, D.N.: Pict: a programming language based on the Pi-calculus. In: Plotkin, G. (Hrsg.), Stirling, C. (Hrsg.), Tofte, M. (Hrsg.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 455\u2013494. MIT Press (2000)","DOI":"10.7551\/mitpress\/5641.003.0022"},{"key":"356_CR47","unstructured":"Rensink, A.: Action contraction. In: Proceedings of the 11th International Conference on Concurrency Theory (CONCUR \u201900), pp. 290\u2013304. Springer, Berlin (2000). ISBN 3-540-67897-2"},{"key":"356_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777110","volume-title":"Introduction to Bisimulation and Coinduction","author":"D Sangiorgi","year":"2012","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press, New York (2012). https:\/\/doi.org\/10.1017\/CBO9780511777110"},{"key":"356_CR49","unstructured":"van Glabbeek, R., Vaandrager, F.: Modular specifications in process algebra. In: Wirsing, M. (Hrsg.), Bergstra, J.A. (Hrsg.) Algebraic Methods: Theory, Tools and Applications. Algebraic Methods 1987, pp. 465\u2013506. Springer, Berlin (1989). ISBN 978-3-540-46758-8"},{"key":"356_CR50","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.: Musings on encodings and expressiveness. In: Proceedings of EXPRESS\/SOS, vol. 89, (EPTCS), pp. 81\u201398 (2012)","DOI":"10.4204\/EPTCS.89.7"},{"key":"356_CR51","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R., Vaandrager, F.: Modular specifications in process algebra\u2014with curious queues\/Centrum Wiskunde & Informatica (1988) (CS-R8821). CWI Report","DOI":"10.1007\/BFb0015049"},{"key":"356_CR52","unstructured":"van Glabbeek, R.: Comparative concurrency semantics and refinement of actions. Centrum Wiskunde & Informatica, Dissertation (1990)"},{"key":"356_CR53","unstructured":"van Glabbeek, R.: Comparative concurrency semantics and refinement of actions. http:\/\/theory.stanford.edu\/~rvg\/thesis.html. Online summary of the Ph.D. Thesis. Accessed 15 Nov 2019"},{"key":"356_CR54","unstructured":"Voorhoeve, M., Mauw, S.: Impossible futures and determinism\/Technische Universiteit Eindhoven, vol. 0014. Computing Science Reports (2000)"},{"issue":"1","key":"356_CR55","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(01)00217-4","volume":"80","author":"M Voorhoeve","year":"2001","unstructured":"Voorhoeve, M., Mauw, S.: Impossible futures and determinism. Inf. Process. Lett. 80(1), 51\u201358 (2001)","journal-title":"Inf. Process. Lett."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-019-00356-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-019-00356-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-019-00356-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T21:45:21Z","timestamp":1722116721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-019-00356-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,28]]},"references-count":55,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s00236-019-00356-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,28]]},"assertion":[{"value":"25 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}