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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Burkhard,H.-D., Two Pumping Lemmata for Petri Nets, EIK, vol. 17 (1981) 349–362.
Grabowski, J., On Hacks Conjecture Concerning Reachability in Petri Nets, EIK, vol. 15 (1979) 339–354.
Hack,M.T ., Decision Problems for Petri Nets and Vector Addition Systems, MIT, Proj. MAC, Comp. Struct. Group Memo, 95–1 (1974).
Hopcroft,J. and Pansiot,J.J., On the Reachability Problem for 5- Dimensional Vector Addition Systems, Theoret. Comp. Sci., vol. 8, (1979) 135–159.
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.
Mayr,E.W ., The Complexity of the finite Containment Problem for Petri Nets, MIT, Lab. for Comp. Sci., TR-181 (1977).
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).
Starke,P.H ., Petri-Netze, VEB Deutscher Verlag der Wissenschaften, ( DDR) Berlin (1980).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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