×
Valk, Ruediger; Vidal-Naquet, Guy

Petri nets and regular languages. (English) Zbl 0473.68057

J. Comput. Syst. Sci. 23, 299-325 (1981).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0473.68057

Cited in 34 Documents

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Keywords:

regularity problem for firing sequence sets of Petri nets; terminal languages of labelled Petri nets
Cite Review PDF
Full Text: DOI

References:

[1] Baker, B.; Book, R., Reversal-bounded multipushdown machines, J. Comput. System Sci., 8, 315-332 (1974) · Zbl 0309.68043
[2] Crespi-Reghizzi, S.; Mandrioli, D., Petri nets and Szilard languages, Inform. Contr., 33, 177-192 (1977) · Zbl 0354.68098
[3] Genrich, H. J.; Lautenbach, K.; Thiagarajan, P. S., Elements of general net theory, (Net Theory and Appliations. Net Theory and Appliations, Lecture Notes in Computer Sci. No. 84 (1980), Springer-Verlag: Springer-Verlag Berlin), 23-163 · Zbl 0441.68064
[4] Ginzburg, A.; Yoeli, M., Vector addition systems and regular languages, J. Comput. System Sci., 20, 277-284 (1980) · Zbl 0446.68043
[5] Greibach, S. A., An infinite hierarchy of context-free languages, J. Assoc. Comput. Mach., 16, 91-106 (1969) · Zbl 0182.02002
[6] Hack, M., Decidability Questions for Petri Nets, (Techn. Rep. 161 (1976), Lab. for Comp. Sci)
[7] Hack, M., Petri Net Languages, (Comp. Struct. Group Memo 124, Project MAC (1975), M.I.T)
[8] Jantzen, M., On the hierarchy of Petri net languages, RAIRO Inform. Théor., 13, 19-30 (1979) · Zbl 0404.68076
[9] Jantzen, M.; Valk, R., Formal properties of place/transition nets, (Net Theory and Applications. Net Theory and Applications, Lecture Notes in Computer Sci. No. 84 (1980), Springer-Verlag: Springer-Verlag Berlin), 166-212
[10] Karp, R. M.; Miller, R. E., Parallel program schemata, J. Comput. System Sci., 3, 4, 167-195 (1969) · Zbl 0198.32603
[11] Minsky, M., Computation: Finite and Infinite Machines (1967), Prentice-Hall: Prentice-Hall Englewood Cliffs, N. J · Zbl 0195.02402
[12] Peterson, J. L., Computation sequence set, J. Comput. System Sci., 13, 1-24 (1976) · Zbl 0354.68100
[13] Rabin, M. O., Decidability of second order theories and automata on infinite trees, Trans. Amer. Soc., 141, 1-35 (1969) · Zbl 0221.02031
[14] Rackoff, C., The covering and boundedness problems for vector addition systems, Theoret. Comput. Sci., 6, 223-231 (1978) · Zbl 0368.68054
[15] Valk, R.; Vidal-Naquet, G., On the rationality of Petri net languages, (Theoretical Computer Science. Theoretical Computer Science, Lecture Notes in Comput. Sci. No. 48 (1977), Springer-Verlag: Springer-Verlag Berlin), 319-328 · Zbl 0368.68067
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.