Computation sequence sets. (English) Zbl 0354.68100


68Q45 Formal languages and automata
Full Text: DOI


[1] Baker, H., Petri nets and languages, ()
[2] Cerf, V.G.; Fernandez, E.B.; Gostelow, K.P.; Volansky, S.A., Formal control-flow properties of a graph model of computation, ()
[3] Crespi-Reghizzi, S.; Mandrioli, D., Petri nets and commutative grammars, () · Zbl 0354.68098
[4] Ginsburg, S., ()
[5] Ginsburg, S.; Greibach, S., Principal AFL, J. comput. system sci., 4, 308-338, (1970) · Zbl 0198.03102
[6] Hack, M., Decision problems for Petri nets and vector addition systems, ()
[7] Hack, M., Petri net languages, ()
[8] Holt, A.W.; Commoner, F., Events and conditions, (), 3-52
[9] Holt, A.W.; Saint, H.; Shapiro, R.M.; Warshall, S., Final report on the information systems project, ()
[10] Hopcraft, J.E.; Ullman, J.D., Formal languages and their relation to automata, () · Zbl 0196.01701
[11] Karp, R.M.; Miller, R.E., Parallel program schemata, J. comput. system sci., 3, 167-195, (1969) · Zbl 0198.32603
[12] Keller, R.M., Vector replacement systems: A formalism for modeling asynchronous systems, ()
[13] Knuth, D.E., ()
[14] Nash, B.O., Reachability problems in vector addition systems, Amer. math. monthly, 80, 292-295, (1973) · Zbl 0273.68034
[15] Parikh, R.J., On context-free languages, J. assoc. comput. Mach., 13, 570-581, (1966) · Zbl 0154.25801
[16] Patil, S.S., Coordination of asynchronous events, ()
[17] Peterson, J.L., Modelling of parallel systems, ()
[18] Petri, C.A., Kommunikation mit automaten, (), German; English transl.: Supplement 1 to Technical Report RADC-TR-65-337, Vol. 1, Rome Air Development Center, Griffiss Air Force Base, New York 1966
[19] Riddle, W.E., The modeling and analysis of supervisory systems, ()
[20] Salomaa, A., ()
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.