Compositional synthesis of live and bounded free choice Petri nets

  • Javier Esparza
  • Manuel Silva
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 527)


The paper defines two notions of composition of concurrent modules modelled by means of Petri nets: synchronisations and fusions. We study these two notions for the class of Free Choice nets, and characterise the compositions (within this class) that preserve liveness (absence of partial or global deadlocks) and boundedness (absence of overflows in finite stores). The characterisation shows which structures must be avoided in order to preserve the properties.


Petri nets Free Choice nets compositional synthesis liveness boundedness 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BD 90]
    Best, E.; Desel, J. 1990: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol.2 No.2, 123–138.Google Scholar
  2. [Best 87]
    Best, E. 1987: Structure Theory of Petri Nets: the Free Choice Hiatus. Advanced Course on Petri Nets / Brauer, Reisig, Rozenberg (eds.), LNCS 254 and 255, pp. 168–205.Google Scholar
  3. [BT 87]
    Best, E.; Thiagarajan, P.S. 1987: Some Classes of Live and Safe Petri Nets. Concurrency and Nets / Voss, K.; Genrich, H.J., Rozenberg, G. (eds.). — Berlin: Springer-Verlag, pp. 71–94.Google Scholar
  4. [Dese 86]
    Desel, J.: A structural property of Free-choice systems. Newsletter of the GI Special Interest Group in Petri Nets and Related System Models, No. 25, pp.16–20.Google Scholar
  5. [Espa 90b]
    Esparza, J.: Structure Theory of Free Choice nets. Ph. D. Thesis, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, June.Google Scholar
  6. [Espa 90]
    Esparza, J. 1990: Synthesis Rules for Petri Nets, and How They Lead to New Results. CONCUR'90 / Baeten, Klop, (eds.), LNCS 458, pp.182–198.Google Scholar
  7. [ES 91]
    Esparza, J.; Silva, M.: Handles in Petri Nets. Hildesheimer Informatik Fachbericht, 3–91.Google Scholar
  8. [ES 90]
    Esparza, J.; Silva, M.: Top-down Synthesis of Live and Bounded Free Choice nets. Proceedings of the XIth. International Conference on Application and Theory of Petri nets. Paris, June, pp. 63–83. To appear in Advances in Petri Nets 91.Google Scholar
  9. [GJRT 83]
    Genrich, H.J.; Jannsens, D.; Rosenberg, G.; Thiagarajan, P.S. 1983: Petri Nets and Their Relation to Graph Grammars. 2nd Int. Workshop on Graph Grammars and their Application to Computer Science. LNCS 153, pp. 115–129.Google Scholar
  10. [Hack 72]
    Hack, M.H.T. 1972: Analysis of Production Schemata by Petri Nets. Cambridge, Mass.: MIT, Dept. Electrical Engineering, MS Thesis. Corrected June 1974Google Scholar
  11. [Silv 87]
    Silva, M. 1987: Towards a Synchrony Theory for P/T Nets. Concurrency and Nets / Voss, K.; Genrich, H.J., Rozenberg, G. (eds.). — Berlin: Springer-Verlag, pp. 71–94.Google Scholar
  12. [TV 84]
    Thiagarajan, P.S.; Voss, K. 1984: A Fresh look at free Choice Nets. Information and Control, Vol. 61, No. 2, May, pp. 85–113.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Javier Esparza
    • 1
  • Manuel Silva
    • 2
  1. 1.Institut für InformatikUniversität HildesheimHildesheimFRG
  2. 2.Depto. Ingeniería Eléctrica e InformáticaUniversidad de ZaragozaZaragozaSpain

Personalised recommendations