no. 1
On the hierarchy of Petri net languages
RAIRO. Informatique théorique, Tome 13 (1979) no. 1, pp. 19-30. 
@article{ITA_1979__13_1_19_0,
     author = {Jantzen, Matthias},
     title = {On the hierarchy of {Petri} net languages},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {19--30},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {1},
     year = {1979},
     mrnumber = {525455},
     zbl = {0404.68076},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1979__13_1_19_0/}
}
TY  - JOUR
AU  - Jantzen, Matthias
TI  - On the hierarchy of Petri net languages
JO  - RAIRO. Informatique théorique
PY  - 1979
SP  - 19
EP  - 30
VL  - 13
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1979__13_1_19_0/
LA  - en
ID  - ITA_1979__13_1_19_0
ER  - 
%0 Journal Article
%A Jantzen, Matthias
%T On the hierarchy of Petri net languages
%J RAIRO. Informatique théorique
%D 1979
%P 19-30
%V 13
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1979__13_1_19_0/
%G en
%F ITA_1979__13_1_19_0
Jantzen, Matthias. On the hierarchy of Petri net languages. RAIRO. Informatique théorique, Tome 13 (1979) no. 1, pp. 19-30. http://www.numdam.org/item/ITA_1979__13_1_19_0/

1. B. S. Baker and R. V. Book, Reversal-Bounded Multipushdown Machines, J. Comp. Syst. Sc., Vol. 8, 1974, pp. 315-332. | MR | Zbl

2. E. T. Bell, Interpolated Denumerants and Lambert Series, Amer. J. Math., Vol. 65, 1943, pp. 382-386. | MR | Zbl

3. W. Brauer, On Grammatical Complexity of Context-Free Languages, M.F.C.S. Proceedings of Symposium and Summerschool, High Tatras, 1973, pp. 191-196. | MR

4. S. Crespi-Reghizzi and D. Mandrioli, Petri Nets and Commutative Grammars, Technical Report 74-5, Istituto Elettronica del Politecnico di Milano, 1974.

5. S. Crespi-Reghizzi and D. Mandrioi, A Decidability Theorem for a Class of Vector-Addition Systems, Information Processing Letters, Vol. 3, 1975, pp. 78-80. | MR | Zbl

6. S. Crespi-Reghizzi and D. Mandrioli, Petri Nets and Szilard Languages, Information and Control, Vol. 33, 1977, pp. 177-192. | MR | Zbl

7. S. Ginsburg and S. A. Greibach, Principal AFL, J. Comp. Syst. Sc., Vol. 4, 1970, pp. 308-338. | MR | Zbl

8. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975. | MR | Zbl

9. S. Ginsburg, J. Goldstine and S. A. Greibach, Some Uniformly Erasable Families of Languages, Theoretical Computer Science, Vol. 2, 1976, pp. 29-44. | MR | Zbl

10. S. A. Greibach, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, Vol. 16, 1969, pp. 91-106. | MR | Zbl

11. S. A. Greibach, Remarks on the Complexity of Nondeterministic Counter Languages, Theoretical Computer Science, Vol. 1, 1976, pp. 269-288. | MR | Zbl

12. S. A. Greibach, Remarks on Blind and Partially Blind One-Way Multicounter Machines, Submitted for Publication, 1978. | MR | Zbl

13. M. Hack, Petri Net Languages, Computation Structures Group Memo 124, Project MAC, M.I.T., 1975.

14. M. Höpner, Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Technical Report IFI-HH-B-12/74, Univ. Hamburg, 1974.

15. M. Höpner and M. Opp, About Three Equational Classes of Languages Built up by Shuffle Operations, Lecture Notes in Computer Science, Springer, Vol. 45, 1976, pp. 337-344. | Zbl

16. M. Jantzen, Eigenschaften von Petrinetzsprachen, Research Report, Univ. Hamburg, 1978.

17. M. Latteux, Cônes rationnels commutativement clos, R.A.I.R.O., Informatique théorique, Vol. 11, 1977, pp. 29-51. | Numdam | MR | Zbl

18. J. Van Leeuwen, A Partial Solution to the Reachibility-Problem for Vector Addition Systems, Proceedings of the 6th annual A.CM. Symposium on Theory of Computing, 1974, pp. 303-309. | MR | Zbl

19. E. Moriya, Associate Languages and Derivational Complexity of Formal Grammars and Languages, Information and Control, Vol. 22, 1973, pp. 139-162. | MR | Zbl

20. B. O. Nash, Reachibility Problems in Vector-Addition Systems, Amer. Math. Monthly, Vol. 80, 1973, pp. 292-295. | MR | Zbl

21. J. L. Peterson, Computation Sequence Sets, J. Comp. Syst. Sc., Vol. 13, 1976, pp. 1-24. | MR | Zbl

22. M. Penttonen, On Derivation Languages Corresponding to Context-Free Grammars, Acta Informatica, Vol. 3, 1974, pp. 285-293. | MR | Zbl

23. G. S. Sacerdote and R. L. Tenney, The Decidability of the Reachability Problem for Vector-Addition Systems, Proceedings of the 9th annual A.C.M. Symposium on Theory of Computing, 1977, pp. 61-76. | MR

24. A. Salomaa, Formal Languages, Academic Press New York and London, 1973. | MR | Zbl

25. E. D. Stotzkij, On Some Restrictions on Derivations in Phrase-Structure Grammars, Akad. Nauk. S.S.S.R. Nauchno-Tekhn., Inform. Ser. 2, 1967, pp. 35-38 (in Russian).

26. R. Valk, Self-Modifying Nets, Technical Report IFI-HH-B-34/77, Univ. Hamburg, 1977.

27. G. Vidal-Naquet, Méthodes pour les problèmes d'ndécidabilité et de complexité sur les réseaux de Petri, in Proceedings of the AFCET Workshop on Petri Nets, Paris, 1977, pp. 137-144.