A proof of the Rank Theorem for extended free choice nets

  • Jörg Desel
Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 616)


A net is called well-formed if it can be marked with a live and bounded marking. The Rank Theorem characterises well-formed extended free choice nets, employing only the linear algebraic representation of a net. The paper presents a proof of the Rank Theorem which is based on the characterisation of liveness by deadlocks and traps and the coverability of well-formed extended free choice nets by S- and T-components. Consequences of the Rank Theorem include the Duality Theorem, a polynomial algorithm for deciding wellformedness, and simple proofs of other results concerning extended free choice nets. Moreover, the Rank Theorem implies a sufficient condition for liveness which applies to arbitrary nets.


free choice nets analysis, structure and behaviour of nets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BD90]
    Best,E.; Desel,J.: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing 2 (2) (1990) 123–138Google Scholar
  2. [BDE92]
    Best,E.; Desel,J.; Esparza,J.: Traps Characterise Home States in Free Choice Systems. To appear in Theoretical Computer Science (1992)Google Scholar
  3. [CCS91]
    Campos,J.; Chiola,G.; Silva,M.: Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control, AC-36 (12) (1991) 1368–1382CrossRefGoogle Scholar
  4. [CCS90]
    Golom.J.M.; Campos,J.; Silva,M.: On Liveness Analysis Through Linear Algebraic Techniques. Departamento de Ingenieria Electrica e Informatica, Universidad de Zaragoza, Research Report GISI-RR-90-11 (1990)Google Scholar
  5. [Des92]
    Desel,J.: Struktur und Analyse von Free-Choice-Petrinetzen. Deutscher Universitäts-Verlag (1992)Google Scholar
  6. [DE92]
    Desel.J.; Esparza.J: Reachability in Cyclic Extended Free Choice Systems. To appear in Theoretical Computer Science (1992)Google Scholar
  7. [Esp90]
    Esparza,J.: Synthesis Rules for Petri Nets, and How they Lead to New Results. LNCS Vol.458: CONCUR '90 (1990) 182–198Google Scholar
  8. [Esp91]
    Esparza,J. Unpublished manuscripts and personal communication.Google Scholar
  9. [ES91]
    Esparza,J.; Silva,M.: On the Analysis and Synthesis of Free Choice Systems. LNCS Vol.483: Advances in Petri Nets 1990 (1991) 243–286Google Scholar
  10. [ES91a]
    Esparza,J.; Silva,M.: Top Down Synthesis of Live and Bounded Free Choice Nets. LNCS Vol.524: Advances in Petri Nets 1991 (1991) 118–139Google Scholar
  11. [ES92]
    Esparza.J.; Silva,M.: A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. To appear in Theoretical Computer Science (1992)Google Scholar
  12. [Hac72]
    Hack,M.: Analysis of Production Schemata by Petri Nets. MIT Project MAC TR-94 (1972); Corrections: Project MAC, Computation Structures Note 17 (1974)Google Scholar
  13. [MR80]
    Memmi,G.; Roucairol,G.: Linear Algebra in Net Theory. LNCS Vol.84: Net Theory and Applications (1980) 213–223Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Jörg Desel
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2

Personalised recommendations