Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

The synthesis problem of Petri nets

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The synthesis problem of concurrent systems is the problem of synthesizing a concurrent system model from sequential observations. The paper studies the synthesis problem for elementary Petri nets and transition systems. A characterization of the class of transition systems which correspond to elementary Petri nets is proven. It is shown how to generate all elementary Petri nets corresponding to a given transition system. If there is any such elementary Petri net, it is proven that there always exists a small one which has only polynomially many elements in the size of the transition system.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Bernadinello: “Synthesis of Net Systems”, Proc. Application and Theory of Petri Nets, Lecture Notes in Computer Science 691, (Springer-Verlag, 1993) 89–105

  2. A. Ehrenfeucht, G. Rozenberg: “Partial 2-structures; Part II, State Space of Concurrent Systems”, Acta Inf. 27 (1990) 348–368

    Google Scholar 

  3. R. Janicki: “Transforming Sequential Systems into Concurrent Systems”, Theoret. Comp. Sci. 36 (1985) 27–58

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Krieg: “Petrinetze und Zustandsgraphen”, IFI-Bericht B-29/77, Institut für Informatik, Universität Hamburg, Germany, 1977

    Google Scholar 

  5. C. Lengauer, E.C.R. Hehner: “A Methodology for Programming with Concurrency: An Informal Presentation”, Sci. of Comp. Progr. 2 (1982) 1–18

    Article  MATH  Google Scholar 

  6. M. Mukund: “Petri Nets and Step Transition Systems”, Int. Journal of Found. of Comp. Sci. 3 No. 4 (1982) 443–478

    Article  MathSciNet  Google Scholar 

  7. M. Nielsen, G. Rozenberg, P.S. Thiagarajan: “Elementary Transition Systems”, Theo. Comp. Sci. 96, 1 (1992) 3–33

    Article  MATH  MathSciNet  Google Scholar 

  8. P.S. Thiagarajan: “Elementary Net Systems”, Advances in Petri Nets 1986 Part I, Lecture Notes in Computer Science 254, (Springer-Verlag, 1987) 26–59

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik der Humboldt-Universität zu Berlin, Unter den Linden 6, D-10099, Berlin, Germany

    Jörg Desel & Wolfgang Reisig

Authors
  1. Jörg Desel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Reisig
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Desel, J., Reisig, W. The synthesis problem of Petri nets. Acta Informatica 33, 297–315 (1996). https://doi.org/10.1007/s002360050046

Download citation

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation