Preview
Unable to display preview. Download preview PDF.
6. References
ASHCROFT, E.A., Proving Assertions about Parallel Programs, Journ. Computer Syst. Scie. 10(1975),110–135
BAKER, B.S., BOOK, V.B., Reversal-Bounded Multipushdown Machines, Journ. Computer Syst. Scie. 8(1974),315–332
COURTOIS, P.J., HEYMANS, F., PARNAS, D.L., Concurrent Control with "Readers" and "Writers", Comm.ACM 14(1971)10,667–668
EILENBERG, S., Automata, Languages and Machines, Vol A, Academic Press, New York, 1974
FUSS,H.E., AFMG — Ein asynchroner Fluss-Modell-Generator, Gesellschaft für Mathematik und Datenverarbeitung, Bericht Nr. 100, Bonn 1975
HACK,M., Decision Problems for Petri Nets and Vector Addition Systems, MAC Techn. Mem. 59, MIT, 1975
HACK,M., Petri Net Languages, MIT Comp. Struct. Group, Memo 124, 1975
JANTZEN, M., On the Hierarchy of Petri Net Languages, submitted to Rev. Française Automat. Informat. Recherche Opérationnelle
PETERSON, J.L., Computation Sequence Sets, Journ. Computer Syst. Scie. 13(1976),1–24
SACERDOTE,G.S., TENNEY,R.L., The Decidability of the Reachability Problem for Vector Addition Systems, (Preliminary Version), Proc. 9th. ACM-Sympos. Theory of Computing, New York 1977
VALK, R., Self-modifying Nets, Institut für Informatik, Universität Hamburg, Bericht IFI-HH-B-34/77
VALK, R., VIDAL-NAQUET, G., On the Rationality of Petri Net Languages, Theoretical Computer Scie., 3rd GI-Conf. 1977, Lec. Notes in Computer Scie., No 48, Springer, Berlin 1977
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valk, R. (1978). Self-modifying nets, a natural extension of Petri nets. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-08860-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08860-8
Online ISBN: 978-3-540-35807-7
eBook Packages: Springer Book Archive