Petri nets, event structures and domains. I. (English) Zbl 0452.68067


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25 Theory of operating systems
Full Text: DOI


[1] Best, E., A theorem on the characteristics of non-sequential processes, (Computing Laboratory Technical Report No. 116 (1977), University of Newcastle-upon-Tyne) · Zbl 0449.68022
[2] Goguen, J. A.; Thatcher, J. W.; Wright, J. B., Initial algebra semantics and continuous algebras, J. ACM, 24, 1, 68-95 (1977) · Zbl 0359.68018
[3] Grätzer, G., Lattice Theory (1971), Freeman: Freeman New York · Zbl 0385.06015
[4] Holt, A. W., Final report of the Information System Theory Project, (Technical Report RADC-TR-68-305 (1968), Rome Air Development Center, Griffith Air Force Base: Rome Air Development Center, Griffith Air Force Base New York)
[5] Kahn, G.; Plotkin, G. D., Domaines concret, (Rapport de Recherche No. 336 (1978), IRIA: IRIA Paris)
[6] Markowsky, G.; Rosen, B., Bases for chain-complete posets, IBM J. Res. Develop., 20, 138-147 (1976) · Zbl 0329.06001
[7] Mazurkiewicz, A., Concurrent program schemes and their interpretations, (DAIMI PB-78 (1977), Aarhus University Publication)
[8] Milne, G.; Milner, R., Concurrent processes and their syntax, J. ACM, 26, 2, 302-321 (1979) · Zbl 0395.68030
[9] Petri, C. A., Non-sequential processes, (Krause, P.; Low, J., Internal Report GMD-ISF-77-05 Bonn (1977), Universität Erlangen-Nürnberg), 8
[10] Petri, C. A., General net theory. Communication disciplines, (Shaw, B., Proc. Joint IBM University of Newcastle Seminar 1976 (1977), University of Newcastle-upon-Tyne) · Zbl 1027.68642
[11] Petri, C. A., Concurrency as a basis of systems thinking, Internal Report (1978), GMD-ISF-76-06 · Zbl 0434.68041
[12] Scott, D., Outline of a mathematical theory of computation, Proc. 4th Annual Princeton Conference on Information Sciences and Systems, 169-176 (1970)
[13] Scott, D., The lattice of flow diagrams, (Engeler, E., Symposium on Semantics of Algorithmic Languages. Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, 188 (1971), Springer: Springer New York), 311-366 · Zbl 0228.68016
[14] Scott, D., Data types as lattices, SIAM J. Comput., 5, 522-587 (1976) · Zbl 0337.02018
[15] Stoy, J. E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory (1978), MIT Press: MIT Press Cambridge, MA · Zbl 0503.68059
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.