Skip to main content
SpringerLink
Log in

Synthesis rules for Petri nets, and how they lead to new results

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 458))

Included in the following conference series:

Abstract

Three kits of rules for top-down synthesis of Petri nets are introduced. The properties and expressive power of the kits are compared. They are then used to characterise the class of structurally live Free Choice nets by means of the rank of the incidence matrix.

This work was partially supported by the DEMON Esprit Basic Research Action 3148

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 (1987).

    Google Scholar 

  2. Campos, J; Chiola, G.: Private communication (1989).

    Google Scholar 

  3. Esparza, J.; Silva, M.: Top-down Synthesis of Live & Bounded Free Choice Nets. To appear in: Proceedings of the XI International Conference on Applications and Theory of Petri Nets, Paris (June 1990).

    Google Scholar 

  4. Esparza, J.: Structure Theory of Free Choice nets. Ph.D. Thesis, University of Zaragoza (June 1990).

    Google Scholar 

  5. Genrich, H.; Thiagarajan, P.S.: A theory of bipolar synchronisation schemes, Theoretical Computer Science, 30, pp. 241–318 (1984).

    Google Scholar 

  6. Jones, N.; Landweber, L.; Lien, Y.: Complexity of some Problems in Petri Nets, Theoretical Computer Science Vol. 4, pp. 277–299 (1977).

    Google Scholar 

  7. Hack, M.H.T.: Analysis of Production Schemata by Petri Nets. TR-94 MIT, Boston (1972, corrected June 1974).

    Google Scholar 

  8. Reisig, W.: Petri Nets. An Introduction. EATCS monographs on Theoretical Computer Science, Vol. 4 (1985).

    Google Scholar 

  9. Silva, M.: Private communication (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Hildesheim, Samelsonplatz 1, D-3200, Hildesheim

    Javier Esparza

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Esparza, J. (1990). Synthesis rules for Petri nets, and how they lead to new results. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039060

Download citation

  • DOI: https://doi.org/10.1007/BFb0039060

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation