{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T16:29:12Z","timestamp":1790180952011,"version":"4.1.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:00:00Z","timestamp":1729641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2024,10,31]]},"abstract":"<jats:p>\n            Event structures have emerged as a foundational model for concurrent computation, explaining computational processes by outlining the events and the relationships that dictate their execution. They play a pivotal role in the study of key aspects of concurrent computation models, such as causality and independence, and have found applications across a broad range of languages and models, spanning realms like persistence, probabilities, and quantum computing. Recently, event structures have been extended to address reversibility, where computational processes can undo previous computations. In this context, reversible event structures provide abstract representations of processes capable of both forward and backward steps in a computation. Since their introduction, event structures have played a crucial role in bridging operational models, traditionally exemplified by Petri nets and process calculi, with denotational ones, i.e., algebraic domains. In this context, we revisit the standard connection between Petri nets and event structures under the lenses of reversibility. Specifically, we introduce a subset of contextual Petri nets, dubbed\n            <jats:italic>reversible causal nets<\/jats:italic>\n            , that precisely correspond to reversible prime event structures. The distinctive feature of reversible causal nets lies in deriving causality from inhibitor arcs, departing from the conventional dependence on the overlap between the postset and preset of transitions. In this way, we are able to operationally explain the full model of reversible prime event structures.\n          <\/jats:p>","DOI":"10.1145\/3686154","type":"journal-article","created":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T16:21:45Z","timestamp":1722615705000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Reversible Perspective on Petri Nets and Event Structures"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0760-0618","authenticated-orcid":false,"given":"Hern\u00e1n","family":"Melgratti","sequence":"first","affiliation":[{"name":"ICC\u2014 Universidad de Buenos Aires, Conicet, Buenos Aires, Argentina"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1556-2623","authenticated-orcid":false,"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[{"name":"Dipartimento di Scienze Pure e Applicate, Universit\u00e0 di Urbino, Urbino, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8911-1580","authenticated-orcid":false,"given":"G. Michele","family":"Pinna","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, Universit\u00e0 di Cagliari, Cagliari, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,10,23]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47361-7_1"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.001"},{"key":"e_1_3_2_4_2","series-title":"CEUR Workshop Proceedings","first-page":"91","volume-title":"International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite Event of the Conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD","volume":"2115","author":"Barylska Kamila","year":"2018","unstructured":"Kamila Barylska, Anna Gogolinska, Lukasz Mikulski, Anna Philippou, Marcin Piatkowski, and Kyriaki Psara. 2018. Reversing Computations Modelled by Coloured Petri Nets. In International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite Event of the Conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD. CEUR Workshop Proceedings, Vol. 2115. CEUR-WS.org, 91\u2013111. DOI: http:\/\/ceur-ws.org\/Vol-2115"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53479-2_4"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07734-5_10"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3019612.3019806"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_31"},{"key":"e_1_3_2_9_2","volume-title":"Software Architecture: The Hard Parts","author":"Ford Neal","year":"2021","unstructured":"Neal Ford, Mark Richards, Pramod Sadalage, and Zhamak Dehghani. 2021. Software Architecture: The Hard Parts. O\u2019Reilly Media, Inc."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38742"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54804-8_26"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47361-7_7"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_21"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21759-4_10"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3648474"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/MITP.2021.3117920"},{"key":"e_1_3_2_17_2","first-page":"331","volume-title":"FORTE \u201992 Conference Proceedings","volume":"10","author":"Langerak Rom","year":"1993","unstructured":"Rom Langerak. 1993. Bundle Event Structures: A Non-interleaving Semantics for LOTOS. In FORTE \u201992 Conference Proceedings. IFIP Transactions, Vol. C-10. Michel Diaz and Roland Groz (Eds.). North-Holland, 331\u2013346."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52482-1_16"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52482-1"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470623"},{"issue":"4","key":"e_1_3_2_21_2","first-page":"5:1","article-title":"Reversing Place Transition Nets","volume":"16","author":"Melgratti Hern\u00e1n C.","year":"2020","unstructured":"Hern\u00e1n C. Melgratti, Claudio Antares Mezzina, and Irek Ulidowski. 2020a. Reversing Place Transition Nets. Logical Methods in Computer Science 16, 4 (2020), 5:1\u20135:28. DOI: https:\/\/lmcs.episciences.org\/6843","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47361-7_1"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178907"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90112-2"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99498-7_6"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.JLAMP.2015.07.004"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36315-3_18"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21834-7_7"},{"key":"e_1_3_2_30_2","volume-title":"Microservices Patterns: With Examples in Java","author":"Richardson Chris","year":"2018","unstructured":"Chris Richardson. 2018. Microservices Patterns: With Examples in Java. Simon and Schuster."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1995.523257"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_42"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.014"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3686154","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3686154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:50Z","timestamp":1750295870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3686154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,23]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10,31]]}},"alternative-id":["10.1145\/3686154"],"URL":"https:\/\/doi.org\/10.1145\/3686154","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,23]]},"assertion":[{"value":"2023-12-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}