Verification of siphons and traps for algebraic Petri nets

  • Karsten Schmidt
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1248)


Siphons and traps are structures which allow for some implications on the net's behaviour and can be used in manual correctness proofs for concurrent systems. We introduce symbolic representations of siphons and traps which work quite well even in infinite cases and are still intuitively readable. The verification of symbolic siphons and traps is traced back to unification and structural induction on the terms. This approach is motivated by some additional considerations. For unification and other proposed structural reasoning mechanisms tool support is given by completeness proof tools studied in the theorem-proving community.


THEORY: Analysis and synthesis structure and behaviour of nets Higher level net models 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BCD95]
    K. Barkaoui, J. M. Couvreur, and C. Dutheillet. On liveness in extended non self-controlling nets. Proc. of the 16th Int. Conf. on Application and Theory of Petri nets, pages 25–44, 1995.Google Scholar
  2. [BDH93]
    K. Barkaoui, C. Dutheillet, and S. Haddad. An efficient algorithm for finding structural deadlocks in colored Petri nets. Proc. of 14th Intern. Conf. on Application and Theory of Petri nets, Chicago, pages 69–88, 1993.Google Scholar
  3. [BM92]
    K. Barkaoui and M. Minoux. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. Proc. of 13. Int. Conf. on Application and Theory of Petri nets, Sheffield, pages 62–74, 1992.Google Scholar
  4. [CM91]
    J.M. Couvreur and J. Martinez. Linear invariants in commutative high level nets. High-level Petri nets, Theory and Application, 1991.Google Scholar
  5. [Com72]
    F. Commoner. Deadlocks in Petri nets. Technical report, Applied Data Research Inc. Wakefield, Massachussetts, 1972.Google Scholar
  6. [Cou90]
    J.M. Couvreur. The general computations of flows for coloured nets. Proc. of the 11th int. Workshop on Application and Theory of Petri nets, 1990.Google Scholar
  7. [ECS93]
    J. Espeleta, J.M. Couvreur, and M. Silva. A new technique for finding a generating family of siphons, traps and st-components. application to colored Petri nets. Advances in Petri nets, pages 126–147, 1993.Google Scholar
  8. [EM85]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications, volume 1 of EATCS Monographs on Theoretical Computer Science 6. Springer, Berlin, 1985.Google Scholar
  9. [Lau87]
    K. Lautenbach. Linear algebraic calculation of deadlock and traps. Advances in Petri nets, pages 315–336, 1987.Google Scholar
  10. [Pau86]
    L.C. Paulson. Isabelle. LNCS 828, Springer, 1994, 1986.Google Scholar
  11. [Rei91]
    W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1–34, 1991.Google Scholar
  12. [RM86]
    R.S. Boyer and J.S. Moore. Overview of a theorem-prover for a computational logic. Proceedings of the 8th Conference on Automated Deduction, Springer, 1986.Google Scholar
  13. [Sch91]
    H.W. Schmidt. Prototyping and analysis of non-sequential systems using predicate-event nets. The Journal of Systems and Software, 15(1):43, April 1991.Google Scholar
  14. [Sch95]
    K. Schmidt. On the computation of place invariants for algebraic Petri nets. Proceedings of the STRICT workshop Berlin, 1995.Google Scholar
  15. [Sch96a]
    K. Schmidt. How to calculate symbolically siphons and traps for some algebraic Petri nets. Technical report, Helsinki University of Technology, Otaniemi, 1996.Google Scholar
  16. [Sch96b]
    K. Schmidt. Siphons, traps and high-level nets with infinite color domains. In preparation, 1996.Google Scholar
  17. [Sch96c]
    K. Schmidt. Symbolische Analysemethoden für algebraische Petri-Netze. PhD thesis, Humboldt-Universität zu Berlin, 1996.Google Scholar
  18. [Sta90]
    P. Starke. Analyse von Petri-Netz-Modellen. B.G. Teubner Stuttgart, 1990.Google Scholar
  19. [Wol92]
    D. Wolz. A tool for checking adt completeness and consistency. Proceedings of the 3rd LOTOSPHERE workshop, Pisa, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Karsten Schmidt
    • 1
    • 2
  1. 1.'96: Digital Systems Laboratory Department of Computer ScienceHelsinki University of TechnologyEspooFinland
  2. 2.'97: Institute of AlgebraUniversity of TechnologyDresdenGermany

Personalised recommendations