{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T13:25:52Z","timestamp":1786973152060,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031997167","type":"print"},{"value":"9783031997174","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99717-4_3","type":"book-chapter","created":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T19:57:35Z","timestamp":1760817455000},"page":"46-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bisimulations and\u00a0Reversibility"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-3043","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5013-5876","authenticated-orcid":false,"given":"Iain","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3834-2036","authenticated-orcid":false,"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,19]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S Abramsky","year":"1987","unstructured":"Abramsky, S.: Observation equivalence as a testing equivalence. Theor. Comput. Sci. 53, 225\u2013241 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90065-X","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jlamp.2016.08.004","volume":"86","author":"C Aubert","year":"2017","unstructured":"Aubert, C., Cristescu, I.: Contextual equivalences in configuration structures and reversibility. J. Logical Algebraic Methods Program. 86(1), 77\u2013106 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.08.004","journal-title":"J. Logical Algebraic Methods Program."},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation. In: Konnov, I., Kov\u00e1cs, L. (eds.) CONCUR. LIPICS, vol. 171, pp. 13:1\u201313:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.7","DOI":"10.4230\/LIPIcs.CONCUR.2020.7"},{"key":"3_CR4","unstructured":"Aubert, C., Cristescu, I.: How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation (research report). Technical report version of\u00a0[3] (2020). arXiv:2005.06814"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Aubert, C., Varacca, D.: Processes against tests: on defining contextual equivalences. J. Logical Algebraic Methods Program. 100799 (2022). https:\/\/doi.org\/10.1016\/j.jlamp.2022.100799","DOI":"10.1016\/j.jlamp.2022.100799"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Baldan, P., Crafa, S.: A logic for true concurrency. J. ACM 61(4), 24:1\u201324:36 (2014). https:\/\/doi.org\/10.1145\/2629638","DOI":"10.1145\/2629638"},{"key":"3_CR7","unstructured":"Bednarczyk, M.A.: Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical report ICS PAS, Polish Academy of Sciences (1991). https:\/\/web.archive.org\/web\/20240430035238\/https:\/\/citeseerx.ist.psu.edu\/document?repid=rep1&type=pdf &doi=0fb01e8f7466c5d0e4fe4f0e7fd74123485ca56c"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4204\/eptcs.412.5","volume":"412","author":"M Bernardo","year":"2024","unstructured":"Bernardo, M., Esposito, A., Mezzina, C.A.: Expansion laws for forward-reverse, forward, and reverse bisimilarities via proved encodings. Electron. Proc. Theor. Comput. Sci. 412, 51\u201370 (2024). https:\/\/doi.org\/10.4204\/eptcs.412.5","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"3_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-031-90897-2_4","volume-title":"FoSSaCS 2025","author":"M Bernardo","year":"2025","unstructured":"Bernardo, M., Esposito, A., Mezzina, C.A.: Alternative characterizations of hereditary history-preserving bisimilarity via backward ready multisets. In: Abdulla, P.A., Kesner, D. (eds.) FoSSaCS 2025. LNCS, vol. 15691, pp. 67\u201387. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-90897-2_4"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-17660-8_52","volume-title":"TAPSOFT \u201987","author":"G Boudol","year":"1987","unstructured":"Boudol, G., Castellani, I.: On the semantics of concurrency: partial orders and transition systems. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) CAAP 1987. LNCS, vol. 249, pp. 123\u2013137. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17660-8_52"},{"key":"3_CR11","unstructured":"Cristescu, I.: Operational and denotational semantics for the reversible $$\\pi $$-calculus. Ph.D. thesis, Universit\u00e9 Paris Diderot \u2013 Paris 7\u2013Sorbonne Paris Cit\u00e9 (2015). http:\/\/scholar.harvard.edu\/files\/cristescu\/files\/these.pdf"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Fabbretti, G., Lanese, I., Stefani, J.B.: Reversibility with holes. In: Mogensen, T.\u00c6., Mikulski, L. (eds.) RC 2024. LNCS, vol. 14680, pp. 69\u201374. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62076-8_5","DOI":"10.1007\/978-3-031-62076-8_5"},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2021.100686","volume":"121","author":"E Graversen","year":"2021","unstructured":"Graversen, E., Phillips, I.C.C., Yoshida, N.: Event structure semantics of (controlled) reversible CCS. J. Logical Algebraic Methods Program. 121, 100686 (2021). https:\/\/doi.org\/10.1016\/j.jlamp.2021.100686","journal-title":"J. Logical Algebraic Methods Program."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-69507-3_33","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"I Lanese","year":"2007","unstructured":"Lanese, I.: Concurrent and located synchronizations in $$\\pi $$-calculus. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 388\u2013399. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69507-3_33"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Lanese, I., Medic, D.: A general approach to derive uncontrolled reversible semantics. In: Konnov, I., Kov\u00e1cs, L. (eds.) CONCUR. LIPICS, vol. 171, pp. 33:1\u201333:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.33","DOI":"10.4230\/LIPIcs.CONCUR.2020.33"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-23217-6_20","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"I Lanese","year":"2011","unstructured":"Lanese, I., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Controlling reversibility in higher-order pi. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 297\u2013311. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_20"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-15375-4_33","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I Lanese","year":"2010","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 478\u2013493. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_33"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.02.019","journal-title":"Theor. Comput. Sci."},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Lanese, I., Phillips, I.C.C.: Forward-reverse observational equivalences in CCSK. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 126\u2013143. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_8","DOI":"10.1007\/978-3-030-79837-6_8"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3648474","volume":"25","author":"I Lanese","year":"2024","unstructured":"Lanese, I., Phillips, I.C.C., Ulidowski, I.: An axiomatic theory for reversible computation. ACM Trans. Comput. Logic 25(2), 1\u201340 (2024). https:\/\/doi.org\/10.1145\/3648474","journal-title":"ACM Trans. Comput. Logic"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Melgratti, H.C., Mezzina, C.A., Pinna, G.M.: A truly concurrent semantics for reversible CCS. Logical Methods Comput. Sci. 20(4) (2024). https:\/\/doi.org\/10.46298\/LMCS-20(4:20)2024","DOI":"10.46298\/LMCS-20(4:20)2024"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Melgratti, H.C., Mezzina, C.A., Ulidowski, I.: Reversing place transition nets. Logical Methods Comput. Sci. 16(4) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(4:5)2020","DOI":"10.23638\/LMCS-16(4:5)2020"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversibility and models for concurrency. In: Hennessy, M.C.B., van Glabbeek, R.J. (eds.) SOS. ENTCS, vol. 192(1), pp. 93\u2013108. Elsevier (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.08.018","DOI":"10.1016\/j.entcs.2007.08.018"},{"issue":"1\u20132","key":"3_CR26","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"ICC Phillips","year":"2007","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Logic Algebraic Program. 73(1\u20132), 70\u201396 (2007). https:\/\/doi.org\/10.1016\/j.jlap.2006.11.002","journal-title":"J. Logic Algebraic Program."},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0960129511000429","volume":"22","author":"ICC Phillips","year":"2012","unstructured":"Phillips, I.C.C., Ulidowski, I.: A hierarchy of reverse bisimulations on stable configuration structures. Math. Struct. Comput. Sci. 22(2), 333\u2013372 (2012). https:\/\/doi.org\/10.1017\/S0960129511000429","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Phillips, I.C.C., Ulidowski, I.: Event identifier logic. Math. Struct. Comput. Sci. 24(2) (2014). https:\/\/doi.org\/10.1017\/S0960129513000510","DOI":"10.1017\/S0960129513000510"},{"issue":"4","key":"3_CR29","doi-asserted-by":"publisher","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fund. Inform. 11(4), 357\u2013404 (1988). https:\/\/doi.org\/10.3233\/FI-1988-11404","journal-title":"Fund. Inform."},{"issue":"4\/5","key":"3_CR30","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 Informatica 37(4\/5), 229\u2013327 (2001). https:\/\/doi.org\/10.1007\/S002360000041","journal-title":"Acta Informatica"},{"issue":"41","key":"3_CR31","doi-asserted-by":"publisher","first-page":"4111","DOI":"10.1016\/j.tcs.2009.06.014","volume":"410","author":"RJ Glabbeek","year":"2009","unstructured":"Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41), 4111\u20134159 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.06.014","journal-title":"Theor. Comput. Sci."},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0012800","volume-title":"Automata, Languages and Programming","author":"G Winskel","year":"1982","unstructured":"Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 561\u2013576. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0012800"},{"key":"3_CR33","unstructured":"Winskel, G.: Event structure semantics for CCS and related languages. DAIMI Research Report 159, University of Aarhus, April 1983. Full version of\u00a0[32], typeset version by Alex Katovsky in April 2011. http:\/\/www.cl.cam.ac.uk\/~gw104\/eventStructures82.pdf. https:\/\/tidsskrift.dk\/index.php\/daimipb\/article\/%20view\/6812\/5891"},{"key":"3_CR34","unstructured":"Winskel, G.: Event Structures, Stable Families and Concurrent Games. Lecture Notes. University of Cambridge (2017). https:\/\/www.cl.cam.ac.uk\/~gw104\/ecsym-notes.pdf"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Semantic Modelling. Handbook of Logic in Computer Science, vol.\u00a04, pp. 1\u2013148. Oxford University Press (1995). https:\/\/doi.org\/10.1093\/oso\/9780198537809.003.0001","DOI":"10.1093\/oso\/9780198537809.003.0001"}],"container-title":["Lecture Notes in Computer Science","Components Operationally: Reversibility and System Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99717-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T12:43:46Z","timestamp":1786970626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99717-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"ISBN":["9783031997167","9783031997174"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99717-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,19]]},"assertion":[{"value":"19 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}