On the computational power of extended petri nets

1. ARAKI, T., KASAMI, T., Some Decision Problems Related to the Reachability Problem for Petri Nets, Theoret. Computer Scie. 3(1977)85–104

   Google Scholar 

2. ASHCROFT, E.A., Proving Assertions about Parallel Programs, Journ. Computer Scie. 10(1975),110–135

   Google Scholar 

3. COURTOIS, P.J., HEYMANS, F., PARNAS, D.L., Concurrent Control with "Readers" and "Writers", Comm.ACM 14(1971)10,667–668

   Article  Google Scholar 

4. EILENBERG, S., Automata, Languages and Machines, Vol. A, Academic Press, New York 1974

   Google Scholar 

5. FUSS,H.E., AFMG — Ein asynchroner Fluss-Modell-Generator, Gesellschaft für Mathem. und Datenverarb. Bonn, Bericht Nr. 100, Bonn 1975

   Google Scholar 

6. HACK,M., Decision Problems for Petri Nets and Vector Addition Systems, MAC Techn. Mem. 59, MIT, 1975

   Google Scholar 

7. HACK,M., Petri Net Languages, MIT Computation Structure Group Memo 124, 1975

   Google Scholar 

8. PETERSON, J.L., Computation Sequence Sets, Journ. ACM 13(1976),1–24

   Google Scholar 

9. 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–318

   Google Scholar 

10. 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 1977

    Google Scholar 

11. VALK, R., Self-modifying Nets, Institut für Informatik, Universität Hamburg, Bericht IFI-HH-B-34/77

    Google Scholar 

Download references