Abstract
This paper deals with the structure theory of Petri nets. We define the class of P/T systems namely K-systems for which the equivalence between controlled-siphon property (cs property), deadlock freeness, and liveness holds. Using the new structural notions of ordered transitions and root places, we revisit the non liveness characterization of P/T systems satisfying the cs property and we define by syntactical manner new and more expressive subclasses of K-systems where the interplay between conflict and synchronization is relaxed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barkaoui, K., Couvreur, J.-M., Dutheillet, C.: On liveness in extended non self-controlling nets. In: Proceeding of the 16th International Conference on Application and Theory of Petri Nets, Turin, pp. 25–44 (June 1995)
Barkaoui, K., Minoux, M.: A polynomial-time graph algorithm to decide liveness of some basic classes of bounded petri nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 62–75. Springer, Heidelberg (1992)
Barkaoui, K., Peyre, J.-F.-P.: On liveness and controlled siphons in petri nets. In: Proceeding of the 16th International Conference on Application and Theory of Petri Nets, Osaka (June 1996)
Barkaoui, K., Zouari, B.: On liveness and deadlock freeness in petri nets. In: Proceeding of the 6th International Symposium in Programming Systems, Algiers (May 2003)
Desel, J.: A proof of the rank theorem for extended free choice nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 134–153. Springer, Heidelberg (1992)
Esparza, J., Silva, M.: A polynomial-time algorithm to decide liveness of bounded free choice nets. Theor. Comput. Sci. 102(1), 185–205 (1992)
Teruel, E., Recalde, L., Silva, M.: Modeling and analysis of sequential processes that cooperate through buffers. IEEE Transactions on Robotics and Automation 11, 267–277 (1985)
Teruel, E., Recalde, L., Silva, M.: Structure theory of multi-level deterministically synchronized sequential processes. Theor. Comput. Sci. 254(1-2), 1–33 (2001)
Lautenbach, K., Ridder, H.: Liveness in bounded petri nets which are covered by T-invariants. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol. 815, pp. 358–375. Springer, Heidelberg (1994)
Reisig, W.: Deterministic buffer synchronization of sequential processes. Acta Informatica 18, 117–134 (1982) (NewsletterInfo: 13)
Reisig, W.: Petri nets: an introduction. Springer, New York, Inc. (1985)
Souissi, Y.: Deterministic systems of sequential processes: A class of structured petri nets. In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, pp. 62–81 (June 1991), (NewsletterInfo: 39)
Teruel, E., Silva, M.: Structure theory of equal conflict systems. Theor. Comput. Sci. 153(1&2), 271–300 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barkaoui, K., Couvreur, JM., Klai, K. (2005). On the Equivalence Between Liveness and Deadlock-Freeness in Petri Nets. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_7
Download citation
DOI: https://doi.org/10.1007/11494744_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26301-2
Online ISBN: 978-3-540-31559-9
eBook Packages: Computer ScienceComputer Science (R0)