Abstract
Causal nets (CNs) are Petri nets where causal dependencies are modelled via inhibitor arcs. They play the role of occurrence nets when representing the behaviour of a concurrent and distributed system, even when reversibility is considered. In this paper we extend CNs to account also for asymmetric conflicts and study (i) how this kind of nets, and their reversible versions, can be turned into a category; and (ii) their relation with the categories of reversible asymmetric event structures.
This work has been supported by the Italian MUR PRIN 2020 project NiRvAna, the French ANR project ANR-18-CE25-0007 DCore, the INdAM-GNCS project CUP_E55F22000270001 Proprietà Qualitative e Quantitative di Sistemi Reversibili, and the European Union - NextGenerationEU program Research and Innovation Program PE00000014 SEcurity and RIghts in the CyberSpace (SERICS), projects Secure and TRaceable Identities in Distributed Environments (STRIDE) and Securing softWare frOm first PrincipleS (SWOPS), the EU H2020 RISE programme under the Marie Skłodowska-Curie grant agreement 778233, UBACyT projects 20020170100544BA and 20020170100086BA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aman, B., et al.: Foundations of reversible computation. In: Ulidowski, I., Lanese, I., Schultz, U.P., Ferreira, C. (eds.) RC 2020. LNCS, vol. 12070, pp. 1–40. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-47361-7_1
Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for petri nets with read and inhibitor arcs. Theor. Comput. Sci. 323(1–3), 129–189 (2004)
Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures, and processes. Inf. Comput. 171(1), 1–49 (2001)
Boudol, G.: Flow event structures and flow nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 62–95. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-53479-2_4
Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible \(\pi \)-calculus. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, pp. 388–397 (2013)
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28644-8_19
Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370–384. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54804-8_26
Graversen, E., Phillips, I., Yoshida, N.: Towards a categorical representation of reversible event structures. J. Log. Algebraic Methods Program. 104, 16–59 (2019)
Lanese, I., Medic, D., Mezzina, C.A.: Static versus dynamic reversibility in CCS. Acta Informatica 58(1–2), 1–34 (2021)
Lanese, I., Mezzina, C.A., Stefani, J.: Reversibility in the higher-order \(\pi \)-calculus. Theor. Comput. Sci. 625, 25–84 (2016)
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–263. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-90686-7_16
Medic, D., Mezzina, C.A., Phillips, I., Yoshida, N.: A parametric framework for reversible \(\pi \)-calculi. Inf. Comput. 275, 104644 (2020)
Melgratti, H.C., Mezzina, C.A., Pinna, G.M.: A distributed operational view of reversible prime event structures. In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, pp. 1–13. IEEE (2021)
Melgratti, H.C., Mezzina, C.A., Pinna, G.M.: Relating reversible Petri nets and reversible event structures, categorically. Technical report (2023). https://arxiv.org/pdf/2302.14195.pdf
Melgratti, H.C., Mezzina, C.A., Ulidowski, I.: Reversing place transition nets. Log. Methods Comput. Sci. 16(4) (2020)
Montanari, U., Rossi, F.: Contextual nets. Acta Informatica 32(6), 545–596 (1995)
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 266–284. Springer, Heidelberg (1979). https://doi.org/10.1007/BFb0022474
Philippou, A., Psara, K.: A collective interpretation semantics for reversing Petri nets. Theor. Comput. Sci. 924, 148–170 (2022)
Philippou, A., Psara, K.: Reversible computation in nets with bonds. J. Log. Algebraic Methods Program. 124, 100718 (2022)
Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. J. Log. Algebraic Methods Program. 84(6), 781–805 (2015)
Phillips, I., Ulidowski, I., Yuen, S.: Modelling of bonding with processes and events. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 141–154. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38986-3_12
Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebraic Methods Program. 73(1–2), 70–96 (2007)
Glabbeek, R.J.: The individual and collective token interpretations of petri nets. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 323–337. Springer, Heidelberg (2005). https://doi.org/10.1007/11539452_26
Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-17906-2_31
Winskel, G.: Petri nets, algebras, morphisms, and compositionality. Inf. Comput. 72(3), 197–238 (1987)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 IFIP International Federation for Information Processing
About this paper
Cite this paper
Melgratti, H., Mezzina, C.A., Pinna, G.M. (2023). Relating Reversible Petri Nets and Reversible Event Structures, Categorically. In: Huisman, M., Ravara, A. (eds) Formal Techniques for Distributed Objects, Components, and Systems. FORTE 2023. Lecture Notes in Computer Science, vol 13910. Springer, Cham. https://doi.org/10.1007/978-3-031-35355-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-031-35355-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-35354-3
Online ISBN: 978-3-031-35355-0
eBook Packages: Computer ScienceComputer Science (R0)