Circuits, handles, bridges and nets

  • Javier Esparza
  • Manuel Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 483)


This paper introduces two new structural objects for the study of nets: handles and bridges. They are shown to provide sufficient, although not necessary, conditions of good behaviour for general ordinary nets, as well as a new characterisation of structural liveness and structural boundedness for the subclass of Free Choice nets. This characterisation is used to approach a modular synthesis theory of Free Choice nets through the synchronisation of State Machines. The task is fully performed for the restricted subclass of Strict Free Choice nets introduced here.


Free Choice nets Structure Theory Synthesis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BEST 84]
    BEST, E.; VOSS, K.: Free Choice Systems have Home States, Acta Informatica, vol. 21, pp. 89–100 (1984).Google Scholar
  2. [BEST 87]
    BEST, E.: Structure Theory of Petri Nets: The Free Choice Hiatus, Advanced Course on Petri Nets, Bad Honnef, Lecture Notes on Computer Science 254–255, Springer Verlag, (1987).Google Scholar
  3. [BETH 87]
    BEST, E.; THIAGARAJAN, P.S.: Some classes of live and safe Petri Nets, In: Concurrency and nets, Voss, Genrich, Rozenberg eds., Springer Verlag, (1987).Google Scholar
  4. [BRAM 83]
    BRAMS, G.W.: Réseaux de Petri. Theorie et Practique, (2 tomos), Masson, Paris (1983).Google Scholar
  5. [COMM 71]
    COMMONER, F.; HOLT, A.W.; EVEN, S; PNUELI, A.: Marked Directed Graphs, Journal of Computing and Systems Sciences, vol. 5, pp. 511–523 (1971).Google Scholar
  6. [DESE 86]
    DESEL, J.: A structural property of Free-choice systems, Petri Net Newsletter 25, (December 1986).Google Scholar
  7. [ESPA 89]
    ESPARZA, J.; BEST, E.; SILVA, M: Minimal deadlocks in Free Choice nets, Hildesheimer Informatik Fachberichte, 1/89 (1989).Google Scholar
  8. [ESPA 90]
    ESPARZA, J: Structure theory of Free Choice nets, Ph. D. Thesis. To appear in 1990.Google Scholar
  9. [GENR 73]
    GENRICH, H.J.; LAUTENBACH, K.: Synchronisationsgraphen, Acta Informatica, vol. 2, pp. 143–161 (1973).Google Scholar
  10. [GENR 83]
    GENRICH, H.J.; JANSSENS, D.; ROZENBERG, G.; THIAGARAJAN, P.S.: Petri Nets and Their Relation to Graph Grammars, 2 nd International Workshop on Graph Grammars and Their Application to Computer Science, LNCS 153, pp. 115–129 (1983).Google Scholar
  11. [GENR 84]
    GENRICH, H.J.; THIAGARAJAN, P.S.: A theory of bipolar synchronisation schemes, Theoretical Computer Science, 30, pp. 241–318 (1984).Google Scholar
  12. [HACK 72]
    HACK, M.H.T.: Analysis of production schemata by Petri Nets. TR-94. MIT. Boston (1972). Corrected June 1974.Google Scholar
  13. [HOAR 85]
    HOARE, C.A.R.: Communicating Sequential Processes, Prentice/Hall, London (1985).Google Scholar
  14. [HOLT 74]
    HOLT, A.W.: Final Report for the Project ‘Development of the Theoretical Foundations for Description and Analysis of Discrete Information Systems', Wakefield, Mass., Applied Data Research, Report CADD-7405-2011 (1974).Google Scholar
  15. [JANT 81]
    JANTZEN, M.; VALK, R.: Formal Properties of Place/Transition-Nets, LNCS 84, pp. 165–212 (1981).Google Scholar
  16. [LAUT 87]
    LAUTENBACH, K.: Linear Algebraic Calculation of deadlocks and traps. In: Concurrency and Nets, Voss, Genrich, Rozenberg eds., Springer Verlag (1987).Google Scholar
  17. [MEMM 80]
    MEMMI, G.; ROUCAIROL, G.: Linear Algebra in Net Theory. In: Net Theory and Applications, Proc. of the first Advanced Course on General Net Theory of Systems and Processes, Brauer ed., LNCS 84, Springer (1980).Google Scholar
  18. [MEMM 83]
    MEMMI, G.: Methode d'analyse de reseaux de Petri. Reseaux a files et applications aux systems temps reel, These d'etat (1983)Google Scholar
  19. [MURA 77]
    MURATA, T.: Circuit Theoretic Analysis and Synthesis of Marked Graphs, IEEE Transactions on Circuits and Systems, vol.cas-24, no 7, (July 1977).Google Scholar
  20. [OLDE 85]
    OLDEROG, E.R.: Semantics, specification and verification. In: Current Trends in Concurrency, de Bakker, de Roever, Rozenberg eds., LNCS 224 (1985).Google Scholar
  21. [PETR 67]
    PETRI, C.A.: Gründsatzliches zur Beschreibung diskreter Prozesse, 3. Colloquium über Automatentheorie, Basel, Birkhaüser Verlag (1967).Google Scholar
  22. [REIS 83]
    REISIG, W.; MEMMI, G.; BERTHELOT, G.: A control structure for sequential processes synchronized by buffers, Proc. of the 4th European Workshop on Application and Theory of Petri nets, Toulouse (1983).Google Scholar
  23. [SILV 85]
    SILVA, M.: Las Redes de Petri en la Automática y la Informática, Editorial AC, Madrid (1985).Google Scholar
  24. [SILV 87]
    SILVA, M.: Towards a Synchrony Theory for P/T Nets. In: Concurrency and Nets, Voss, Genrich, Rozenberg eds., Springer Verlag (1987).Google Scholar
  25. [SOUI 88]
    SOUISSI, Y: Les systemes deterministes de processus séquentiels, MASI Report (February 1988).Google Scholar
  26. [THIA 84]
    THIAGARAJAN, P.S.; VOSS, K.: A Fresh Look at Free Choice Nets, Information and Control, vol. 61, no 2, (May 1984).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 HildesheimGermany
  2. 2.Dpto. Ingeniería Eléctrica e InformáticaUniversidad de ZaragozaSpain

Personalised recommendations