{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:16:17Z","timestamp":1784736977883,"version":"3.55.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030853143","type":"print"},{"value":"9783030853150","type":"electronic"}],"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,8,20]],"date-time":"2021-08-20T00:00:00Z","timestamp":1629417600000},"content-version":"vor","delay-in-days":231,"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>This paper shows that quasi-open bisimilarity is the <jats:italic>coarsest bisimilarity congruence<\/jats:italic> for the applied <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\pi $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                    <mml:mi>\u03c0<\/mml:mi>\n                  <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus. Furthermore, we show that this equivalence is suited to security and privacy problems expressed as an equivalence problem in the following senses: (1) being a bisimilarity is a safe choice since it does not miss attacks based on rich strategies; (2) being a congruence it enables a compositional approach to proving certain equivalence problems such as unlinkability; and (3) being the coarsest such bisimilarity congruence it can establish proofs of some privacy properties where finer equivalences fail to do so.<\/jats:p>","DOI":"10.1007\/978-3-030-85315-0_14","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T12:05:42Z","timestamp":1629374742000},"page":"235-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Compositional Analysis of Protocol Equivalence in the Applied $$\\pi $$-Calculus Using Quasi-open Bisimilarity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0162-1901","authenticated-orcid":false,"given":"Ross","family":"Horne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2818-4433","authenticated-orcid":false,"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9200-4601","authenticated-orcid":false,"given":"Semen","family":"Yurkov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"issue":"1\u20132","key":"14_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci. 367(1\u20132), 2\u201332 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.08.032","journal-title":"Theor. Comput. Sci."},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL, pp. 104\u2013115 (2001). https:\/\/doi.org\/10.1145\/360204.360213","DOI":"10.1145\/360204.360213"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.tcs.2003.12.023","volume":"322","author":"M Abadi","year":"2004","unstructured":"Abadi, M., Fournet, C.: Private authentication. Theor. Comput. Sci. 322(3), 427\u2013476 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.12.023","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"14_CR4","first-page":"267","volume":"5","author":"M Abadi","year":"1998","unstructured":"Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nord. J. Comput. 5(4), 267\u2013303 (1998)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3127586","volume":"65","author":"M Abadi","year":"2017","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: The applied pi calculus: mobile values, new names, and secure communication. J. ACM 65(1), 1\u201341 (2017). https:\/\/doi.org\/10.1145\/3127586","journal-title":"J. ACM"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Ahn, K.Y., Horne, R., Tiu, A.: A characterisation of open bisimilarity using an intuitionistic modal logic. In: Meyer, R., Nestmann, U. (eds.) 28th International Conference on Concurrency Theory, CONCUR 2017, 5\u20138 September 2017, Berlin, Germany, vol. 85 of LIPIcs, pp. 7:1\u20137:17 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.7","DOI":"10.4230\/LIPIcs.CONCUR.2017.7"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Ahn, K.Y., Horne, R., Tiu, A.: A characterisation of open bisimilarity using an intuitionistic modal logic. Log. Meth. Comp. Sci. (2021). https:\/\/arxiv.org\/abs\/1701.05324. In press","DOI":"10.46298\/lmcs-17(3:2)2021"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In 23rd IEEE Computer Security Foundations Symposium, pp. 107\u2013121 (2010). https:\/\/doi.org\/10.1109\/CSF.2010.15","DOI":"10.1109\/CSF.2010.15"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2017.01.027","volume":"672","author":"M Ayala-Rinc\u00f3n","year":"2017","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Intruder deduction problem for locally stable theories with normal forms and inverses. Theor. Comput. Sci. 672, 64\u2013100 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.01.027","journal-title":"Theor. Comput. Sci."},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Log. Meth. Comp. Sci. 7(1) (2011). https:\/\/doi.org\/10.2168\/LMCS-7(1:11)2011","DOI":"10.2168\/LMCS-7(1:11)2011"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Blanchet, B.: Automatic proof of strong secrecy for security protocols. In: 2004 Proceedings of IEEE Symposium on Security and Privacy, pp. 86\u2013100. IEEE (2004). https:\/\/doi.org\/10.1109\/SECPRI.2004.1301317","DOI":"10.1109\/SECPRI.2004.1301317"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2007.06.002","volume":"75","author":"B Blanchet","year":"2008","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. J. Log. Algebr. Program. 75(1), 3\u201351 (2008). https:\/\/doi.org\/10.1016\/j.jlap.2007.06.002","journal-title":"J. Log. Algebr. Program."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12\u201315 August 2006, Seattle, WA, USA, Proceedings, pp. 69\u201380. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/LICS.2006.46","DOI":"10.1109\/LICS.2006.46"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1145\/2631916","volume":"15","author":"F Bonchi","year":"2014","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: A general theory of barbs, contexts, and labels. ACM Trans. Comput. Log. 15(4), 35:1-35:27 (2014). https:\/\/doi.org\/10.1145\/2631916","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/S0097539700377864","volume":"31","author":"M Boreale","year":"2001","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM J. Comput. 31(3), 947\u2013986 (2001). https:\/\/doi.org\/10.1137\/S0097539700377864","journal-title":"SIAM J. Comput."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2009.07.078","volume":"242","author":"J Borgstr\u00f6m","year":"2009","unstructured":"Borgstr\u00f6m, J.: A complete symbolic bisimilarity for an extended Spi calculus. Electron. Notes Theor. Comput. Sci. 242(3), 3\u201320 (2009). https:\/\/doi.org\/10.1016\/j.entcs.2009.07.078","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1017\/S0960129505004706","volume":"15","author":"J Borgstr\u00f6m","year":"2005","unstructured":"Borgstr\u00f6m, J., Nestmann, U.: On bisimulations for the Spi calculus. Math. Struct. Comput. Sci. 15(3), 487\u2013552 (2005). https:\/\/doi.org\/10.1017\/S0960129505004706","journal-title":"Math. Struct. Comput. Sci."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-28644-8_11","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J Borgstr\u00f6m","year":"2004","unstructured":"Borgstr\u00f6m, J., Briais, S., Nestmann, U.: Symbolic bisimulation in the Spi calculus. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 161\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_11"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2007.07.010","volume":"386","author":"S Briais","year":"2007","unstructured":"Briais, S., Nestmann, U.: Open bisimulation, revisited. Theor. Comput. Sci. 386(3), 236\u2013271 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.07.010","journal-title":"Theor. Comput. Sci."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ic.2014.07.006","volume":"238","author":"S Bursuc","year":"2014","unstructured":"Bursuc, S., Comon-Lundh, H., Delaune, S.: Deducibility constraints and blind signatures. Inf. Comput. 238, 106\u2013127 (2014). https:\/\/doi.org\/10.1016\/j.ic.2014.07.006","journal-title":"Inf. Comput."},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-36830-1_12","volume-title":"Principles of Security and Trust","author":"V Cheval","year":"2013","unstructured":"Cheval, V., Blanchet, B.: Proving more observational equivalences with ProVerif. In: Basin, D., Mitchell, J.C. (eds.) POST 2013. LNCS, vol. 7796, pp. 226\u2013246. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36830-1_12"},{"issue":"Part 1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ic.2017.05.004","volume":"255","author":"V Cheval","year":"2017","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: A procedure for deciding symbolic equivalence between sets of constraint systems. Inf. Comput. 255(Part 1), 94\u2013125 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.05.004","journal-title":"Inf. Comput."},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Cortier, V., Smyth, B.: Attacking and fixing Helios: an analysis of ballot secrecy. In: 2011 IEEE 24th Computer Security Foundations Symposium, pp. 297\u2013311, June 2011. https:\/\/doi.org\/10.1109\/CSF.2011.27","DOI":"10.1109\/CSF.2011.27"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Delaune, S.: Analysing privacy-type properties in cryptographic protocols. In: Kirchner, H. (ed.) 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), volume 108 of LIPIcs, Dagstuhl, Germany, pp. 1:1\u20131:21. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2018.1","DOI":"10.4230\/LIPIcs.FSCD.2018.1"},{"issue":"2","key":"14_CR25","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3233\/JCS-2010-0363","volume":"18","author":"S Delaune","year":"2010","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Symbolic bisimulation for the applied pi calculus. J. Comput. Secur. 18(2), 317\u2013377 (2010). https:\/\/doi.org\/10.3233\/JCS-2010-0363","journal-title":"J. Comput. Secur."},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-030-29959-0_28","volume-title":"Computer Security \u2013 ESORICS 2019","author":"I Filimonov","year":"2019","unstructured":"Filimonov, I., Horne, R., Mauw, S., Smith, Z.: Breaking unlinkability of the ICAO 9303 standard for e-passports using bisimilarity. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 577\u2013594. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_28"},{"key":"14_CR27","unstructured":"Horne, R.: A bisimilarity congruence for the applied pi-calculus sufficiently coarse to verify privacy properties. Arxiv, arXiv:1811.02536, pp. 1\u201331 (2018.). https:\/\/arxiv.org\/abs\/1811.02536"},{"issue":"2","key":"14_CR28","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.23638\/LMCS-17(2:24)2021","volume":"17","author":"R Horne","year":"2021","unstructured":"Horne, R., Mauw, S.: Discovering ePassport vulnerabilities using bisimilarity. Logical Methods in Computer Science 17(2), 24:1-24:52 (2021). https:\/\/doi.org\/10.23638\/LMCS-17(2:24)2021","journal-title":"Logical Methods in Computer Science"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Horne, R., Ahn, K.Y., Lin, S., Tiu, A.: Quasi-open bisimilarity with mismatch is intuitionistic. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of LICS 2018: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2018), Oxford, United Kingdom, 9\u201312 July 2018, p. 10 (2018). https:\/\/doi.org\/10.1145\/3209108.3209125","DOI":"10.1145\/3209108.3209125"},{"key":"14_CR30","unstructured":"Horne, R., Mauw, S., Yurkov, S.: Breaking and fixing unlinkability of the key agreement protocol for 2nd gen EMV payments (2021). https:\/\/arxiv.org\/abs\/2105.02029"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Johansson, M., Bengtson, J., Victor, B., Parrow, J.: Weak equivalences in psi-calculi. In: 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp. 322\u2013331, July 2010. https:\/\/doi.org\/10.1109\/LICS.2010.30","DOI":"10.1109\/LICS.2010.30"},{"issue":"3","key":"14_CR32","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jlap.2012.01.001","volume":"81","author":"M Johansson","year":"2012","unstructured":"Johansson, M., Victor, B., Parrow, J.: Computing strong and weak bisimulations for psi-calculi. J. Logic Algebraic Program. 81(3), 162\u2013180 (2012). https:\/\/doi.org\/10.1016\/j.jlap.2012.01.001","journal-title":"J. Logic Algebraic Program."},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.: Analysis of an electronic voting protocol in the applied pi calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 186\u2013200. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_14"},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2012.07.034","volume":"458","author":"J Liu","year":"2012","unstructured":"Liu, J., Lin, H.: A complete symbolic bisimulation for full applied pi calculus. Theor. Comput. Sci. 458, 76\u2013112 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.07.034","journal-title":"Theor. Comput. Sci."},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Milner, R.: The polyadic $$\\pi $$-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI Series, vol. 94, pp. 203\u2013246 (1993). https:\/\/doi.org\/10.1007\/978-3-642-58041-3_6","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation, pp. 685\u2013695 (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_114","DOI":"10.1007\/3-540-55719-9_114"},{"issue":"1","key":"14_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Part I and II. Inf. Comput. 100(1), 1\u2013100 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","journal-title":"Inf. Comput."},{"issue":"2","key":"14_CR38","first-page":"171","volume":"16","author":"U Montanari","year":"1992","unstructured":"Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundam. Inf. 16(2), 171\u2013199 (1992)","journal-title":"Fundam. Inf."},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-60246-1_153","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D Sangiorgi","year":"1995","unstructured":"Sangiorgi, D.: On the proof method for bisimulation. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 479\u2013488. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60246-1_153"},{"issue":"1","key":"14_CR40","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the $$\\pi $$-calculus. Acta Inf. 33(1), 69\u201397 (1996). https:\/\/doi.org\/10.1007\/s002360050036","journal-title":"Acta Inf."},{"key":"14_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-44685-0_20","volume-title":"CONCUR 2001\u2014Concurrency Theory","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: On barbed equivalences in $$\\pi $$-calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 292\u2013304. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_20"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-76637-7_25","volume-title":"Programming Languages and Systems","author":"A Tiu","year":"2007","unstructured":"Tiu, A.: A trace based bisimulation for the Spi calculus: an extended abstract. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 367\u2013382. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_25"},{"key":"14_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-47958-3_5","volume-title":"Programming Languages and Systems","author":"A Tiu","year":"2016","unstructured":"Tiu, A., Nguyen, N., Horne, R.: SPEC: an equivalence checker for security protocols. In: Igarashi, A. (ed.) APLAS 2016. LNCS, vol. 10017, pp. 87\u201395. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47958-3_5"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J.: The linear time\u2014branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6. ISBN 3-540-57208-2","DOI":"10.1007\/3-540-57208-2_6"},{"issue":"4\/5","key":"14_CR45","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"RJ van Glabbeek","year":"2001","unstructured":"van 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."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85315-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:06:10Z","timestamp":1630022770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85315-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030853143","9783030853150"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85315-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2021.github.io\/","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":"55","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":"20","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":"0","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":"36% - 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":"3","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)"}}]}}