Skip to main content
SpringerLink
Log in

On priorities of parallelism: Petri nets under the maximum firing strategy

  • Conference paper
  • First Online:
Logics of Programs and Their Applications (Logic of Programs 1980)

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

Included in the following conference series:

Abstract

The computational power of Petri nets is extended up to the power of counter machines by realizing certain priorities of parallelism. Hence certain concurrent computations can not exactly be reflected by the sets of all sequentialized computations in related systems. Moreover, the reachability, boundedness and liveness problems are undecidable under the modified firing rule.

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. Burkhard, H.D., Ordered Firing in Petri Nets, Elektron.Informationsverarb.Kybernetik 17(1981)2/3, 71–86.

    Google Scholar 

  2. Burkhard, H.D., Two Pumping Lemmata for Petri Nets. To appear in Elektron.Informationsverarb.Kybernetik.

    Google Scholar 

  3. Hack, M., Decision Problems for Petri Nets and Vector Addition Systems, MAC-TM 59, Proj.MAC, M.I.T. 1975.

    Google Scholar 

  4. Hack, M., Petri net languages, CSG Memo 124, Proj.MAC, M.I.T. 1975.

    Google Scholar 

  5. Hopcroft, J., Pansiot, J.J., On the reachability problem for 5-dimensional vector addition systems, Theor.Comp.Science 8(1979), 135–159.

    Google Scholar 

  6. Jones, N., Landweber, L., Lien, E., Complexity of some problems in Petri nets, Theor.Comp.Science 4(1977), 277–299.

    Google Scholar 

  7. Karp, R.M., Miller, R.E., Parallel Program Schemata, Journ. Comp. and System Sciences 3(1969), 147–195.

    Google Scholar 

  8. Keller, R.M., Vector replacement systems: a formalism for modelling asynchronous systems, Tech.Rep.117, Comp.Science Lab., Princeton Univ., 1972/74.

    Google Scholar 

  9. Keller, R.M., Generalized Petri nets as models for system verification, Tech.Rep.202, Dept.Electrical Eng., Princeton Univ., 1975.

    Google Scholar 

  10. Mori, M., Araki, T., Taniguchi, K., Tokura, N., Kasami, T., Some decision problems for time Petri nets and applications to the verification of communication protocols, Trans.IECE'77/10 Vol.J60-D, No. 10, 822–829.

    Google Scholar 

  11. Moalla, M., Pulou, J., Sifakis, J., Synchronized Petri nets: A model for the description of non-autonomous systems, Lecture Notes in Computer Science 64(1978), 374–384.

    Google Scholar 

  12. Salwicki, A., Müldner, T., On algorithmic properties of concurrent programs, Manuscript, Warsaw 1979.

    Google Scholar 

  13. Valk, R., Self-modifying nets, a natural extension of Petri nets, Lecture Notes in Computer Science 62(1978), 464–476.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt-Universität, PSF 1297, DDR-1086, Berlin

    Hans-Dieter Burhard

Authors
  1. Hans-Dieter Burhard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Salwicki

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burhard, HD. (1983). On priorities of parallelism: Petri nets under the maximum firing strategy. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-11981-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11981-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation