On the computational power of extended petri nets

  • Rüdiger Valk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /AK/.
    ARAKI, T., KASAMI, T., Some Decision Problems Related to the Reachability Problem for Petri Nets, Theoret. Computer Scie. 3(1977)85–104Google Scholar
  2. /As/.
    ASHCROFT, E.A., Proving Assertions about Parallel Programs, Journ. Computer Scie. 10(1975),110–135Google Scholar
  3. /CHP/.
    COURTOIS, P.J., HEYMANS, F., PARNAS, D.L., Concurrent Control with "Readers" and "Writers", Comm.ACM 14(1971)10,667–668CrossRefGoogle Scholar
  4. /Ei/.
    EILENBERG, S., Automata, Languages and Machines, Vol. A, Academic Press, New York 1974Google Scholar
  5. /Fu/.
    FUSS,H.E., AFMG — Ein asynchroner Fluss-Modell-Generator, Gesellschaft für Mathem. und Datenverarb. Bonn, Bericht Nr. 100, Bonn 1975Google Scholar
  6. /Ha1/.
    HACK,M., Decision Problems for Petri Nets and Vector Addition Systems, MAC Techn. Mem. 59, MIT, 1975Google Scholar
  7. /Ha2/.
    HACK,M., Petri Net Languages, MIT Computation Structure Group Memo 124, 1975Google Scholar
  8. /Pe/.
    PETERSON, J.L., Computation Sequence Sets, Journ. ACM 13(1976),1–24Google Scholar
  9. /Pr/.
    PRINOTH,R., Eigenschaften färbbarer Petri-Netze, Theoret.Computer Scie., 3rd GI-Conf. 1977, Lec. Notes in Computer Scie., No 48, Springer Berlin, 1977, pp. 306–318Google Scholar
  10. /ST/.
    SACERDOTE,G.S., TENNEY,R.L., The Decidability of the Reachability Problem for Vector Addition Systems, (Preliminary version), Proc. 9th. ACM-Symp. Theory of Computing, New York 1977Google Scholar
  11. /Va/.
    VALK, R., Self-modifying Nets, Institut für Informatik, Universität Hamburg, Bericht IFI-HH-B-34/77Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Rüdiger Valk
    • 1
  1. 1.Fachbereich InformatikUniversität HamburgGermany

Personalised recommendations