{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:24:41Z","timestamp":1776317081526,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030223960","type":"print"},{"value":"9783030223977","type":"electronic"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-22397-7_2","type":"book-chapter","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T18:14:14Z","timestamp":1559672054000},"page":"19-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Reversing P\/T Nets"],"prefix":"10.1007","author":[{"given":"Hern\u00e1n","family":"Melgratti","sequence":"first","affiliation":[]},{"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[]},{"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"key":"2_CR1","unstructured":"Barylska, K., Gogoli\u0144ska, A., Mikulski, \u0141., Philippou, A., Pia\u0327tkowski, M., Psara, K.: Reversing computations modelled by coloured Petri nets. In: van der Aalst, W.M.P., Bergenthum, R., Carmona, J. (eds.) ATED, vol. 2115, pp. 91\u2013111. CEUR-WS.org (2018)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.scico.2017.10.008","volume":"151","author":"Kamila Barylska","year":"2018","unstructured":"Barylska, K., Koutny, M., Mikulski, \u0141., Pia\u0327tkowski, M.: Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program. 151, 48\u201360 (2018). https:\/\/doi.org\/10.1016\/j.scico.2017.10.008","journal-title":"Science of Computer Programming"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups (preliminary report). In: Proceedings of STOC, pp. 50\u201354. ACM (1976). https:\/\/doi.org\/10.1145\/800113.803630","DOI":"10.1145\/800113.803630"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible $$\\pi $$-calculus. In: Symposium on Logic in Computer Science, LICS, pp. 388\u2013397. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-25150-9_14","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"ID Cristescu","year":"2015","unstructured":"Cristescu, I.D., Krivine, J., Varacca, D.: Rigid families for CCS and the $$\\pi $$-calculus. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 223\u2013240. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_14"},{"key":"2_CR6","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":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_31"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-99498-7_7","volume-title":"Reversible Computation","author":"E Graversen","year":"2018","unstructured":"Graversen, E., Phillips, I., Yoshida, N.: Event structure semantics of (controlled) reversible CCS. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 102\u2013122. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_7"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Hayman, J., Winskel, G.: The unfolding of general Petri nets. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS. LIPIcs, vol. 2, pp. 223\u2013234 (2008). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2008.1755","DOI":"10.4230\/LIPIcs.FSTTCS.2008.1755"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Hoey, J., Ulidowski, I., Yuen, S.: Reversing imperative parallel programs with blocks and procedures. In: Proceedings of EXPRESS\/SOS (2018)","DOI":"10.4204\/EPTCS.276.7"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-40578-0_2","volume-title":"Reversible Computation","author":"S Kuhn","year":"2016","unstructured":"Kuhn, S., Ulidowski, I.: A calculus for local reversibility. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 20\u201335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_2"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"2_CR14","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.: 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":"2_CR15","unstructured":"Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent reversibility. Bull. EATCS 114 (2014)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-90686-7_16","volume-title":"Functional and Logic Programming","author":"I Lanese","year":"2018","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: CauDEr: a causal-consistent reversible debugger for Erlang. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 247\u2013263. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_16"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/5001.5005","volume":"8","author":"GB Leeman Jr","year":"1986","unstructured":"Leeman Jr., G.B.: A formal approach to undo operations in programming languages. ACM Trans. Program. Lang. Syst. 8(1), 50\u201387 (1986). https:\/\/doi.org\/10.1145\/5001.5005","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","volume":"2","author":"J L\u00e9vy","year":"1976","unstructured":"L\u00e9vy, J.: An algebraic interpretation of the $$\\lambda \\beta {K}$$-calculus; and an application of a labelled $$\\lambda $$-calculus. Theor. Comput. Sci. 2(1), 97\u2013114 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90009-8","journal-title":"Theor. Comput. Sci."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Medic, D., Mezzina, C.A., Phillips, I., Yoshida, N.: A parametric framework for reversible $$\\pi $$-calculi. In: P\u00e9rez, J.A., Tini, S. (eds.) Proceedings of EXPRESS\/SOS. EPTCS, vol. 276, pp. 87\u2013103 (2018)","DOI":"10.4204\/EPTCS.276.8"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13, 85\u2013108 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90112-2","journal-title":"Theor. Comput. Sci."},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-99498-7_6","volume-title":"Reversible Computation","author":"A Philippou","year":"2018","unstructured":"Philippou, A., Psara, K.: Reversible computation in Petri nets. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 84\u2013101. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_6"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2007.08.018","volume":"192","author":"Iain Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. In: Proceedings of SOS 2007. ENTCS, vol. 192, pp. 93\u2013108 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1\u20132","key":"2_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007). https:\/\/doi.org\/10.1016\/j.jlap.2006.11.002","journal-title":"J. Log. Algebr. Program."},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/j.jlamp.2015.07.004","volume":"84","author":"I Phillips","year":"2015","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. J. Log. Algebr. Meth. Program. 84(6), 781\u2013805 (2015). https:\/\/doi.org\/10.1016\/j.jlamp.2015.07.004","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_18"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-73359-3_16","volume-title":"Membrane Computing","author":"GM Pinna","year":"2018","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 245\u2013261. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73359-3_16"},{"issue":"3","key":"2_CR27","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00354-018-0038-2","volume":"36","author":"M Schordan","year":"2018","unstructured":"Schordan, M., Oppelstrup, T., Jefferson Jr., D., Barnes, P.D.: Generation of reversible C++ code for optimistic parallel discrete event simulation. New Gener. Comput. 36(3), 257\u2013280 (2018). https:\/\/doi.org\/10.1007\/s00354-018-0038-2","journal-title":"New Gener. Comput."},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00354-018-0040-8","volume":"36","author":"I Ulidowski","year":"2018","unstructured":"Ulidowski, I., Phillips, I., Yuen, S.: Reversing event structures. New Gener. Comput. 36(3), 281\u2013306 (2018). https:\/\/doi.org\/10.1007\/s00354-018-0040-8","journal-title":"New Gener. Comput."},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-99498-7_20","volume-title":"Reversible Computation","author":"M Vassor","year":"2018","unstructured":"Vassor, M., Stefani, J.-B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 286\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20"},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00856ED1V01Y201805DCS054","volume":"13","author":"Alexis De Vos","year":"2018","unstructured":"Vos, A.D., Baerdemacker, S.D., Rentergem, Y.V.: Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits. Synthesis Lectures on Digital Circuits and Systems, Morgan & Claypool Publishers (2018). https:\/\/doi.org\/10.2200\/S00856ED1V01Y201805DCS054","journal-title":"Synthesis Lectures on Digital Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22397-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:02:24Z","timestamp":1685836944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22397-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030223960","9783030223977"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22397-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kongens Lyngby","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2019\/coordination","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}