On the Reversibility of Well-Behaved Weighted Choice-Free Systems
A Petri net is reversible if its initial marking is a home marking, a marking reachable from any reachable marking. Under the assumption of well-behavedness we investigate the property of reversibility for strongly connected weighted Choice-Free Petri nets, nets which structurally avoid conflicts. Several characterizations of liveness and reversibility as well as exponential methods for building live and home markings are available for these nets. We provide a new characterization of reversibility leading to the construction in polynomial time of an initial marking with a polynomial number of tokens that is live and reversible. We also introduce a polynomial time transformation of well-formed Choice-Free systems into well-formed T-systems and we deduce from it a polynomial time sufficient condition of liveness and reversibility for well-formed Choice-Free systems. We show that neither one of these two approaches subsumes the other.
KeywordsReversibility well-behavedness polynomial conditions decomposition place-splitting transformation weighted Petri nets Choice-Free Fork-Attribution T-system
Unable to display preview. Download preview PDF.
- 6.Barkaoui, K., Petrucci, L.: Structural Analysis of Workflow Nets with Shared Resources. In: van der Aalst, W.M.P., De Michelis, G., Ellis, C.A. (eds.) Proceedings of Workflow Management: Net-Based Concepts, Models, Techniques and Tools (WFM 1998). Computing Science Report, vol. 98/7, pp. 82–95 (1998)Google Scholar
- 10.Berthelot, G.: Transformations and Decompositions of Nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 359–376. Springer, Heidelberg (1987)Google Scholar
- 18.Delosme, J.M., Hujsa, T., Munier-Kordon, A.: Polynomial Sufficient Conditions of Well-behavedness for Weighted Join-Free and Choice-Free Systems. In: Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD 2013), pp. 90–99 (2013)Google Scholar
- 19.Hujsa, T., Delosme, J.M., Munier-Kordon, A.: Polynomial Sufficient Conditions of Well-behavedness and Home Markings in Subclasses of Weighted Petri Nets. Transactions on Embedded Computing Systems (to appear, 2014)Google Scholar