Publication: Reversing Steps in Petri Nets
Loading...
Official URL
Full text at PDC
Publication Date
2019-05-31
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Citations
Exportar
Abstract
In 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.
Description
The 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_11
UCM subjects
Unesco subjects
Keywords
Citation
1. E. Badouel and Ph. Darondeau. Theory of regions. In LNCS 1491, pages 529-586, 1996.
2. K. Barylska, E. Best, E. Erofeev, L. Mikulski, and M. Piatkowski. Conditions for Petri net solvable binary words. ToPNoC, 11:137-159, 2016.
3. K. Barylska, E. Erofeev, M. Koutny, L. Mikulski, and M. Piatkowski. Reversing transitions in bounded Petri nets. volume 157, pages 341-357, 2018.
4. K. Barylska, M. Koutny, L. Mikulski, and M. Piatkowski. Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program., 151:48-60, 2018.
5. L. Cardelli and C. Laneve. Reversible structures. In Proc. of CMSB'11, pages 131-140, 2011.
6. M.E. Cohen. Systems for financial and electronic commerce, September 3 2013. US Patent 8,527,406.
7. V. Danos and J. Krivine. Reversible communicating systems. In Proc. of CON-CUR'04, volume 3170 of LNCS, pages 292-307. 2004.
8. V. Danos and J. Krivine. Transactions in RCCS. In Proc. of CONCUR'05, volume 3653 of LNCS, pages 398-412. 2005.
9. V. Danos, J. Krivine, and P. Sobocinski. General reversibility. Electr. Notes Theor. Comp. Sci., 175(3):75-86, 2007.
10. Ph. Darondeau, M. Koutny, M. Pietkiewicz-Koutny, and A. Yakovlev. Synthesis of nets with step firing policies. Fundam. Inform., 94(3-4):275-303, 2009.
11. D. de Frutos-Escrig, M. Koutny, and L. Mikulski. An efficient characterization of Petri net solvable binary words. In Proc. of ATPN'18, pages 207-226, 2018.
12. E. Erofeev, K. Barylska, L. Mikulski, and M. Piatkowski. Generating all minimal Petri net unsolvable binary words. In Proc. of PSC'16, pages 33-46, 2016.
13. J. Esparza and M. Nielsen. Decidability issues for Petri nets. BRICS Report Series, 1(8), 1994.
14. T. Hujsa, J.-M. Delosme, and A. Munier Kordon. On the reversibility of live equal conflict Petri nets. In Proc. of ATPN'15, volume 9115 of LNCS, pages 234-253, 2015.
15. I. Lanese, C.A. Mezzina, and J.-B. Stefani. Reversing higher-order Pi. In Proc. of CONCUR'10, volume 6269 of LNCS, pages 478-493, 2010.
16. H.A. Özkan and A. Aybar. A reversibility enforcement approach for Petri nets using invariants. WSEAS Transactions on Systems, 7:672-681, 2008.
17. I. Phillips and I. Ulidowski. Reversing algebraic process calculi. J. of Log. and Alg. Prog., 73(1-2):70-96, 2007.
18. I. Phillips and I. Ulidowski. Reversibility and asymmetric conflict in event structures. J. of Log. and Alg. Meth. in Prog., 84(6):781-805, 2015.
19. W. Reisig. Understanding Petri Nets-Modeling Techniques, Analysis Methods, Case Studies. 2013.
20. A. De Vos. Reversible Computing-Fundamentals, Quantum Computing, and Applications. 2010.