{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:19:20Z","timestamp":1743128360759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174613"},{"type":"electronic","value":"9783030174620"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17462-0_14","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T01:49:28Z","timestamp":1554342568000},"page":"244-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing Coupled Similarity"],"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":[[2019,4,4]]},"reference":[{"key":"14_CR1","unstructured":"Bisping, B.: Computing coupled similarity. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2018). \n                      https:\/\/coupledsim.bbisping.de\/bisping_computingCoupledSimilarity_thesis.pdf"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Bisping, B.: Isabelle\/HOL proof and Apache Flink program for TACAS 2019 paper: Computing Coupled Similarity (artifact). Figshare (2019). \n                      https:\/\/doi.org\/10.6084\/m9.figshare.7831382.v1","DOI":"10.6084\/m9.figshare.7831382.v1"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00165-016-0366-2","volume":"28","author":"A Boulgakov","year":"2016","unstructured":"Boulgakov, A., Gibson-Robinson, T., Roscoe, A.W.: Computing maximal weak and other bisimulations. Formal Aspects Comput. 28(3), 381\u2013407 (2016). \n                      https:\/\/doi.org\/10.1007\/s00165-016-0366-2","journal-title":"Formal Aspects Comput."},{"key":"14_CR4","unstructured":"Carbone, P., Katsifodimos, A., Ewen, S., Markl, V., Haridi, S., Tzoumas, K.: Apache Flink: stream and batch processing in a single engine. In: Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, vol. 36, no. 4 (2015)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44880-2_10","volume-title":"ZB 2003: Formal Specification and Development in Z and B","author":"J Derrick","year":"2003","unstructured":"Derrick, J., Wehrheim, H.: Using coupled simulations in non-atomic refinement. In: Bert, D., Bowen, J.P., King, S., Wald\u00e9n, M. (eds.) ZB 2003. LNCS, vol. 2651, pp. 127\u2013147. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-44880-2_10"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Garavel, H.: The VLTS benchmark suite (2017). \n                      https:\/\/doi.org\/10.18709\/perscido.2017.11.ds100\n                      \n                    . Jointly created by CWI\/SEN2 and INRIA\/VASY as a CADP resource","DOI":"10.18709\/perscido.2017.11.ds100"},{"issue":"2","key":"14_CR7","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. Tools Technol. Transfer 15(2), 89\u2013107 (2013). \n                      https:\/\/doi.org\/10.1007\/s10009-012-0244-z","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-54862-8_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Gibson-Robinson","year":"2014","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3 \u2014 a modern refinement checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 187\u2013201. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54862-8_13"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"RJ Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time \u2014 branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993). \n                      https:\/\/doi.org\/10.1007\/3-540-57208-2_6"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-51046-0_14","volume-title":"Concurrency, Security, and Puzzles","author":"RJ Glabbeek van","year":"2017","unstructured":"van Glabbeek, R.J.: A branching time model of CSP. In: Gibson-Robinson, T., Hopcroft, P., Lazi\u0107, R. (eds.) Concurrency, Security, and Puzzles. LNCS, vol. 10160, pp. 272\u2013293. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-51046-0_14"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM (JACM) 43(3), 555\u2013600 (1996). \n                      https:\/\/doi.org\/10.1145\/233551.233556","journal-title":"J. ACM (JACM)"},{"key":"14_CR12","series-title":"Texts in Theoretical Computer Science an EATCS Series","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-68804-8_3","volume-title":"Finite Model Theory and Its Applications","author":"E Gr\u00e4del","year":"2007","unstructured":"Gr\u00e4del, E.: Finite model theory and descriptive complexity. In: Gr\u00e4del, E., et al. (eds.) Finite Model Theory and Its Applications. Texts in Theoretical Computer Science an EATCS Series, pp. 125\u2013130. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/3-540-68804-8_3"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3060140","volume":"18","author":"JF Groote","year":"2017","unstructured":"Groote, J.F., Jansen, D.N., Keiren, J.J.A., Wijs, A.J.: An \n                      \n                        \n                      \n                      $$\\cal{O}(m \\log n)$$\n                     algorithm for computing stuttering equivalence and branching bisimulation. ACM Trans. Comput. Logic (TOCL) 18(2), 13:1\u201313:34 (2017). \n                      https:\/\/doi.org\/10.1145\/3060140","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4204\/EPTCS.190.5","volume":"190","author":"Meike Hatzel","year":"2015","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). \n                      https:\/\/doi.org\/10.4204\/EPTCS.190.5","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, pp. 453\u2013462 (1995). \n                      https:\/\/doi.org\/10.1109\/SFCS.1995.492576","DOI":"10.1109\/SFCS.1995.492576"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TKDE.2017.2762294","volume":"30","author":"V Kalavri","year":"2018","unstructured":"Kalavri, V., Vlassov, V., Haridi, S.: High-level programming abstractions for distributed graph processing. IEEE Trans. Knowl. Data Eng. 30(2), 305\u2013324 (2018). \n                      https:\/\/doi.org\/10.1109\/TKDE.2017.2762294","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/978-3-662-46681-0_61","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Kant","year":"2015","unstructured":"Kant, G., Laarman, A., Meijer, J., van de Pol, J., Blom, S., van Dijk, T.: LTSmin: high-performance language-independent model checking. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 692\u2013707. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46681-0_61"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/3-540-45694-5_39","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"A Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: Why is simulation harder than bisimulation? In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 594\u2013609. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45694-5_39"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Li, W.: Algorithms for computing weak bisimulation equivalence. In: Third IEEE International Symposium on Theoretical Aspects of Software Engineering, 2009. TASE 2009, pp. 241\u2013248. IEEE (2009). \n                      https:\/\/doi.org\/10.1109\/TASE.2009.47","DOI":"10.1109\/TASE.2009.47"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-39467-6_18","volume-title":"Big Data","author":"Y Luo","year":"2013","unstructured":"Luo, Y., de Lange, Y., Fletcher, G.H.L., De Bra, P., Hidders, J., Wu, Y.: Bisimulation reduction of big graphs on MapReduce. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds.) BNCOD 2013. LNCS, vol. 7968, pp. 189\u2013203. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39467-6_18"},{"key":"14_CR21","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"issue":"1","key":"14_CR22","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). \n                      https:\/\/doi.org\/10.1006\/inco.2000.2868","journal-title":"Inf. Comput."},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/BFb0084813","volume-title":"CONCUR 1992","author":"J Parrow","year":"1992","unstructured":"Parrow, J., Sj\u00f6din, P.: Multiway synchronization verified with coupled simulation. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 518\u2013533. Springer, Heidelberg (1992). \n                      https:\/\/doi.org\/10.1007\/BFb0084813"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-57785-8_171","volume-title":"STACS 94","author":"J Parrow","year":"1994","unstructured":"Parrow, J., Sj\u00f6din, P.: The complete axiomatization of Cs-congruence. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 555\u2013568. Springer, Heidelberg (1994). \n                      https:\/\/doi.org\/10.1007\/3-540-57785-8_171"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"46","DOI":"10.4204\/EPTCS.190.4","volume":"190","author":"Kirstin Peters","year":"2015","unstructured":"Peters, K., van 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, EXPRESS\/SOS, pp. 46\u201360 (2015). \n                      https:\/\/doi.org\/10.4204\/EPTCS.190.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"5","key":"14_CR26","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ic.2008.01.001","volume":"206","author":"F Ranzato","year":"2008","unstructured":"Ranzato, F., Tapparo, F.: Generalizing the Paige-Tarjan algorithm by abstract interpretation. Inf. Comput. 206(5), 620\u2013651 (2008). \n                      https:\/\/doi.org\/10.1016\/j.ic.2008.01.001\n                      \n                    . Special Issue: The 17th International Conference on Concurrency Theory (CONCUR 2006)","journal-title":"Inf. Comput."},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2009.06.002","volume":"208","author":"F Ranzato","year":"2010","unstructured":"Ranzato, F., Tapparo, F.: An efficient simulation algorithm based on abstract interpretation. Inf. Comput. 208(1), 1\u201322 (2010). \n                      https:\/\/doi.org\/10.1016\/j.ic.2009.06.002","journal-title":"Inf. Comput."},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-44618-4_22","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"A Rensink","year":"2000","unstructured":"Rensink, A.: Action contraction. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 290\u2013305. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/3-540-44618-4_22"},{"key":"14_CR29","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). \n                      https:\/\/doi.org\/10.1017\/CBO9780511777110"},{"key":"14_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Springer, New York (2001). \n                      https:\/\/doi.org\/10.1007\/978-1-4757-3550-5"},{"issue":"1","key":"14_CR31","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). \n                      https:\/\/doi.org\/10.1016\/S0020-0190(01)00217-4","journal-title":"Inf. Process. Lett."},{"key":"14_CR32","unstructured":"Wenzel, M.: The Isabelle\/Isar Reference Manual (2018). \n                      https:\/\/isabelle.in.tum.de\/dist\/Isabelle2018\/doc\/isar-ref.pdf"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/11901914_35","volume-title":"Automated Technology for Verification and Analysis","author":"R Wimmer","year":"2006","unstructured":"Wimmer, R., Herbstritt, M., Hermanns, H., Strampp, K., Becker, B.: Sigref \u2013 a symbolic bisimulation tool box. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 477\u2013492. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11901914_35"}],"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-17462-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T12:07:32Z","timestamp":1570018052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17462-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174613","9783030174620"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17462-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 April 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/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":"164","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":"42","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":"8","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":"26% - 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":"13","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":"12 full papers and 11 short papers accepted for TOOLympics and SV-COMP (avg. 4 reviewers\/paper, selected from 43 submissions)","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)"}}]}}