Skip to main content
SpringerLink
Log in

Notions of Computability by Petri Nets

  • Conference paper
Applications and Theory of Petri Nets

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 66))

  • 53 Accesses

Abstract

Eleven different definitions for functions to be computable by Petri nets are given and compared. For nine of these definitions it was possible to show that they are not powerful enough to describe all the primitive recursive functions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burkhard,H.-D., Two Pumping Lemmata for Petri Nets, EIK, vol. 17 (1981) 349–362.

    MathSciNet  MATH  Google Scholar 

  2. Grabowski, J., On Hacks Conjecture Concerning Reachability in Petri Nets, EIK, vol. 15 (1979) 339–354.

    MathSciNet  MATH  Google Scholar 

  3. Hack,M.T ., Decision Problems for Petri Nets and Vector Addition Systems, MIT, Proj. MAC, Comp. Struct. Group Memo, 95–1 (1974).

    Google Scholar 

  4. Hopcroft,J. and Pansiot,J.J., On the Reachability Problem for 5- Dimensional Vector Addition Systems, Theoret. Comp. Sci., vol. 8, (1979) 135–159.

    Article  MathSciNet  MATH  Google Scholar 

  5. Jantzen,M. and Valk,R., Formal Properties of Place Transition Nets, in: Net Theory and Applications, W.Brauer (ed.), Lect. Notes in Comp. Sci., vol. 84 (1980) 165–212.

    Google Scholar 

  6. Mayr,E.W ., The Complexity of the finite Containment Problem for Petri Nets, MIT, Lab. for Comp. Sci., TR-181 (1977).

    Google Scholar 

  7. Mayr,E.W ., Ein Algorithmus für das allgemeine Erreichbarkeitsproblem bei Petrinetzen und damit zusammenhängende Probleme, Techn. Univ. München, Inst, für Informatik, techn. report TUM I 8010 (1980).

    MATH  Google Scholar 

  8. Starke,P.H ., Petri-Netze, VEB Deutscher Verlag der Wissenschaften, ( DDR) Berlin (1980).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Schlüterstraße 70, D-2000, Hamburg 13, Germany

    Matthias Jantzen

  2. Mathematisches Seminar, Universität Hamburg, Bundesstraße 55, D-2000, Hamburg 13, Germany

    Hendrik Bramhoff

Authors
  1. Matthias Jantzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hendrik Bramhoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Istituto di Metodi Quantitativi, Università “Luigi Bocconi”, Via Sarfatti, 25, 20136, Milano, Italy

    Anastasia Pagnoni

  2. Institut of Applied Mathematics and Computer Science, University of Leiden, Wassenaarseweg 80, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jantzen, M., Bramhoff, H. (1983). Notions of Computability by Petri Nets. In: Pagnoni, A., Rozenberg, G. (eds) Applications and Theory of Petri Nets. Informatik-Fachberichte, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69028-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69028-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12309-5

  • Online ISBN: 978-3-642-69028-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation