×

Computation sequence sets. (English) Zbl 0354.68100


MSC:

68Q45 Formal languages and automata
Full Text: DOI

References:

[1] Baker, H., Petri nets and languages, (Computation Structures Group Memo 68 (1972), Project MAC, Massachusetts Institute of Technology)
[2] Cerf, V. G.; Fernandez, E. B.; Gostelow, K. P.; Volansky, S. A., Formal control-flow properties of a graph model of computation, (Report ENG-7178 (1971), Computer Science Department, University of California: Computer Science Department, University of California Los Angeles)
[3] Crespi-Reghizzi, S.; Mandrioli, D., Petri nets and commutative grammars, (Rapporto Interno 74-5 (1974), Laboratorio di Calcolatori, Istituto di Elettrotecnica ed Elettronica del Politecnico di Milano) · Zbl 0354.68098
[4] Ginsburg, S., (The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill: McGraw-Hill New York) · Zbl 0184.28401
[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, (Computation Structures Group Memo 95 (1974), Project MAC, Massachusetts Institute of Technology)
[7] Hack, M., Petri net languages, (Computation Structures Group Memo 124 (1975), Project MAC, Massachusetts Institute of Technology)
[8] Holt, A. W.; Commoner, F., Events and conditions, (Record of the Project MAC Conference on Concurrent Systems and Parallel Computation (1970), ACM: ACM New York), 3-52
[9] Holt, A. W.; Saint, H.; Shapiro, R. M.; Warshall, S., Final report on the information systems project, (Report RADC-TR-68-305 (1968), Rome Air Development Center, Griffiss Air Force Base: Rome Air Development Center, Griffiss Air Force Base New York)
[10] Hopcraft, J. E.; Ullman, J. D., Formal Languages and Their Relation to Automata, ((1969), Addison-Wesley: Addison-Wesley Reading, Mass.) · 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, (Technical Report 117 (1972), Department of Electrical Engineering, Princeton University)
[13] Knuth, D. E., (“The Art of Computer Programming” Vol. 3: “Sorting and Searching” (1973), Addison-Wesley: Addison-Wesley Menlo Park, Calif.) · Zbl 0302.68010
[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, (Ph. D. Thesis (1970), Department of Electrical Engineering, Massachusetts Institute of Technology)
[17] Peterson, J. L., Modelling of parallel systems, (Ph. D. Thesis (1973), Department of Electrical Engineering, Stanford University)
[18] Petri, C. A., Kommunikation mit automaten, (Ph. D. Thesis (1962), University of Bonn: University of Bonn Germany), 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, (Ph. D. Thesis (1972), Department of Computer Science, Stanford University)
[20] Salomaa, A., (Formal Languages (1973), Academic Press: Academic Press New York) · Zbl 0262.68025
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.