Advertisement

On the Equivalence Between Liveness and Deadlock-Freeness in Petri Nets

  • Kamel Barkaoui
  • Jean-Michel Couvreur
  • Kais Klai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3536)

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.

Keywords

structure theory liveness deadlock-freeness cs-property 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Esparza, J., Silva, M.: A polynomial-time algorithm to decide liveness of bounded free choice nets. Theor. Comput. Sci. 102(1), 185–205 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Teruel, E., Recalde, L., Silva, M.: Structure theory of multi-level deterministically synchronized sequential processes. Theor. Comput. Sci. 254(1-2), 1–33 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Reisig, W.: Deterministic buffer synchronization of sequential processes. Acta Informatica 18, 117–134 (1982) (NewsletterInfo: 13) Google Scholar
  11. 11.
    Reisig, W.: Petri nets: an introduction. Springer, New York, Inc. (1985)zbMATHGoogle Scholar
  12. 12.
    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) Google Scholar
  13. 13.
    Teruel, E., Silva, M.: Structure theory of equal conflict systems. Theor. Comput. Sci. 153(1&2), 271–300 (1996)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kamel Barkaoui
    • 1
  • Jean-Michel Couvreur
    • 2
  • Kais Klai
    • 2
  1. 1.CEDRIC-CNAMParisFrance
  2. 2.LaBRIUniversit de BordeauxFrance

Personalised recommendations