On the reversibility of live equal-conflict petri nets

7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A Petri net is reversible if its initial marking is a home marking, a marking reachable from any reachable marking. This property is fundamental in man-made systems as it lets a system return to its initial state using only internal operations. Necessary and sufficient conditions are already known for the reversibility of well-formed Choice-Free and ordinary Free-Choice nets. Like the homogeneous Join-Free nets, these nets constitute subclasses of Equal-Conflict nets. In this larger class, the reversibility property is not well understood. This paper provides the first characterization of reversibility for all the live Equal-Conflict systems by extending, in a weaker form, a known condition that applies to the Choice-Free and Free-Choice subclasses. We also show that this condition is tightly related to the Equal-Conflict class and does not apply to several other classes.

Cite

CITATION STYLE

APA

Hujsa, T., Delosme, J. M., & Munier-Kordon, A. (2015). On the reversibility of live equal-conflict petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9115, pp. 234–253). Springer Verlag. https://doi.org/10.1007/978-3-319-19488-2_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free