Skip to main content
SpringerLink
Log in

Towards reachability trees for high-level petri nets

  • Conference paper
  • First Online:
Advances in Petri Nets 1984

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

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. H.J. Genrich and K. Lautenbach: System modelling with high-level Petri nets, Theoretical Computer Science 13 (1981), 109–136.

    Article  Google Scholar 

  2. M. Hack: Decidability questions for Petri Nets. TR 161, MIT, 1976.

    Google Scholar 

  3. P. Huber, A.M. Jensen, L.O. Jepsen and K. Jensen: Towards reach-ability trees for high-level Petri nets. DAIMI PB-174, Computer Science Department, Aarhus University, 1984. Identical to the present paper, except for 3 appendices which contain the proof of lemmas 1–6, analysis of two examples, and our algorithm to test two ω-markings for equivalence.

    Google Scholar 

  4. K. Jensen: Coloured Petri nets and the invariant-method. Theoretical Computer Science 14 (1981), 317–336.

    Article  Google Scholar 

  5. K. Jensen: How to find invariants for coloured Petri nets. In: J. Gruska, M. Chytill (eds.): Mathematical Foundations of Computer Science 1981, Lecture Notes in Computer Science, vol. 118, Springer-Verlag, 1981, 327–338.

    Google Scholar 

  6. K. Jensen: High-level Petri nets. In: A. Pagnoni and G. Rozenberg (eds.): Applications and Theory of Petri Nets, Informatik-Fachberichte vol. 66, Springer-Verlag 1983, 166–180.

    Google Scholar 

  7. R.M. Karp and R.E. Miller: Parallel program schemata. Journal of Computer and System Sciences, vol. 3 (1969), 147–195.

    Google Scholar 

  8. J.L. Peterson: Petri net theory and the modellings of systems. Prentice-Hall 1981.

    Google Scholar 

  9. W. Reisig: Petri nets with individual tokens. In: A. Pagnoni and G. Rozenberg (eds.): Applications and Theory of Petri Nets, Informatik-Fachberichte vol. 66, Springer-Verlag 1983, 229–249.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Aarhus University Ny Munkegade, DK-8000, Aarhus C, Denmark

    Peter Huber, Arne M. Jensen, Leif O. Jepsen & Kurt Jensen

Authors
  1. Peter Huber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arne M. Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leif O. Jepsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kurt Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K. (1985). Towards reachability trees for high-level petri nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-15204-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39320-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation