Frutos Escrig, David DeKoutny, MaciejMikulski, Łukasz2023-06-172023-06-172019-05-31Frutos Escrig, D., Koutny, M. & Mikulski, Ł. «Reversing Steps in Petri Nets». Application and Theory of Petri Nets and Concurrency, editado por Susanna Donatelli y Stefan Haar, vol. 11522, Springer International Publishing, 2019, pp. 171-91. DOI.org (Crossref), https://doi.org/10.1007/978-3-030-21571-2_11.0302-974310.1007/978-3-030-21571-2_11https://hdl.handle.net/20.500.14352/12425The original publication is available at www.springerlink.com Reversing Steps in Petri Nets. In: Donatelli S., Haar S. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2019. Lecture Notes in Computer Science, vol 11522. Springer, Cham. https://doi.org/10.1007/978-3-030-21571-2_11In reversible computations one is interested in the development of mechanisms allowing to undo the effects of executed actions. The past research has been concerned mainly with reversing single actions. In this paper, we consider the problem of reversing the effect of the execution of groups of actions (steps). Using Petri nets as a system model, we introduce concepts related to this new scenario, generalising notions used in the single action case. We then present a number of properties which arise in the context of reversing of steps of executed transitions in place/transition nets. We obtain both positive and negative results, showing that dealing with steps makes reversibility more involved than in the sequential case. In particular, we demonstrate that there is a crucial difference between reversing steps which are sets and those which are true multisets.engjournal articlehttps://doi.org/10.1007/978-3-030-21571-2_11https://link.springer.com/open access519.7Petri netReversible computationStep semanticsInteligencia artificial (Informática)Cibernética matemáticaTopología1203.04 Inteligencia Artificial1207.03 Cibernética1210 Topología