Reversible Computation vs. Reversibility in Petri Nets
Petri nets are a general formal model of concurrent systems which supports both action-based and state-based modelling and reasoning. One of important behavioural properties investigated in the context of Petri nets has been reversibility, understood as the possibility of returning to the initial marking from any reachable net marking. Thus reversibility in Petri nets is a global property. Reversible computation, on the other hand, is typically a local mechanism using which a system can undo some of the executed actions. This paper is concerned with the modelling of reversible computation within Petri nets. A key idea behind the proposed construction is to add ‘reverse’ versions of selected transitions. Since such a modification can severely impact on the behavior of the system, it is crucial, in particular, to be able to determine whether the modified system has a similar set of states as the original one. We first prove that the problem of establishing whether the two nets have the same reachable markings is undecidable even in the restricted case discussed in this paper. We then show that the problem of checking whether the reachability sets of the two nets cover the same markings is decidable.
KeywordsPetri net Reversibility Reversible computation Decidability
We would like to thank the anonymous reviewers for their remarks which allowed us to improve the presentation of the paper. This work was supported by the EU COST Action IC1405, and by the Polish National Science Center (grant No. 2013/09/D/ST6/03928).
- 5.Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Proceedings of 8th Interaction and Concurrency Experience (ICE 2015), EPTCS, vol. 189, pp. 53–67 (2015)Google Scholar
- 7.Cardelli, L., Laneve, C.: Reversible structures. In: Fages, F. (ed.) Proceedings of 9th International Computational Methods in Systems Biology (CMSB 2011), pp. 131–140. ACM (2011)Google Scholar
- 11.de Frutos Escrig, D., Johnen, C.: Decidability of home space property. Technical report 503, Laboratoire de Recherche en Informatique, Université de Paris-Sud (1989)Google Scholar
- 14.Michael, H.: Decidability questions for Petri nets. Technical report TR-161, MIT Laboratory for Computer Science (1976)Google Scholar
- 15.Michael, H.: Petri net languages. Technical report TR 159, MIT Laboratory for Computer Science (1976)Google Scholar
- 18.Kezić, D., Perić, N., Petrović, I.: An algorithm for deadlock prevention based on iterative siphon control of Petri net. Automatika 47, 19–30 (2006)Google Scholar
- 20.Özkan, H.A., Aybar, A.: A reversibility enforcement approach for Petri nets using invariants. WSEAS Trans. Syst. 7, 672–681 (2008)Google Scholar
- 28.Vogler, W.: Live and bounded free choice nets have home states. Petri Net Newslett. 32, 18–21 (1989)Google Scholar
- 29.Wang, P., Ding, Z., Chai, H.: An algorithm for generating home states of Petri nets. J. Comput. Inf. Syst. 12(7), 4225–4232 (2011)Google Scholar