In praise of free choice nets

  • P. S. Thiagarajan
  • K. Voss
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 188)


Live and safe free choice nets constitute an attractive class of Petri nets. This is evidenced by the fundamental results worked out by Hack. There are some essential additional properties which make them even more appealing. In this paper we bring out these additional structural and behavioural properties. We shall also argue that these properties are what makes live and safe free choice nets fly. We show through examples that each such property breaks down for a “next” larger class of nets called simple nets.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BS83]
    Best, E.; Shields, M.W.: Some Equivalence Results for Free Choice and Simple Nets and on the Periodicity of Live Free Choice Nets. Proc. CAAP 83, 8th Colloquium on Trees in Algebra and Programming, L'Aquila, March 9–11, 1983, 14 pp.Google Scholar
  2. [Br80]
    Brauer, W. (ed.): Net Theory and Applications. Lecture Notes in Computer Science 84. Springer-Verlag, Berlin Heidelberg New York, 1980Google Scholar
  3. [Co72]
    Commoner, F.: Deadlocks in Petri Nets. Wakefield, Applied Data Research Inc., CA-7206-2311, 1972Google Scholar
  4. [CHEP71]
    Commoner, F.; Holt, A.W.; Even, S.; Pnueli, A.: Marked Directed Graphs. J. Computer and System Science 5, 1971, pp. 511–523Google Scholar
  5. [GL73]
    Genrich, H.J.; Lautenbach, K.: Synchronisationsgraphen. Acta Informatica 2, 1973, pp. 143–161CrossRefGoogle Scholar
  6. [GS80]
    Genrich, H.J.; Stankiewicz-Wiechno, E.: A Dictionary of some Basic Notions of Net Theory. In pp. 519–535Google Scholar
  7. [GT83]
    Genrich, H.J.; Thiagarajan, P.S.: A Theory of Bipolar Synchronisation Schemes. Report DAIMI PB-158, Aarhus University, March 1983, 130 pp. Also to appear in TCS.Google Scholar
  8. [Ha72]
    Hack, M.H.T.: Analysis of Production Schemata by Petri Nets. Project MAC, Massachusetts Institute of Technology. Cambridge, Massachusetts, Feb. 1972, 119 pp.Google Scholar
  9. [Ho74]
    Holt, A.W.: Final Report for the Project ‘Development of the Theoretical Foundations for Description and Analysis of Discrete Information Systems'. Wakefield, Mass., Massachusetts Computer Associates Inc., 20.5.1974Google Scholar
  10. [JV80]
    Jantzen, M.; Valk, R.: Formal Properties of Place/Transition Nets. In pp. 165–212Google Scholar
  11. [QS82]
    Queille, J.P.; Sifakis, J.: A Temporal Logic to Deal with Fairness in Transition Systems. Proc. of 23. FoCS, 1982, pp. 217–225. Also to appear in Acta Informatica.Google Scholar
  12. [Sh81]
    Shields, M.W.: On the Non-Sequential Behaviour of Systems Possessing a Generalised Free Choice Property. Internal Report CRS-92-81, Edinburgh University, Sept. 1981.Google Scholar
  13. [TV83]
    Thiagarajan, P.S.; Voss, K.: A Fresh Look at Free Choice Nets. Arbeitspapiere der GMD, Nr. 58, St. Augustin, Oct. 1983, 42 pp. Also to appear in Information and Control.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • P. S. Thiagarajan
    • 1
  • K. Voss
    • 1
  1. 1.Institut für Methodische Grundlagen Gesellschaft für Mathematik und DatenverarbeitungSt. AugustinGermany

Personalised recommendations