zbMATH — the first resource for mathematics

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, () · 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 New York · Zbl 0385.06015
[4] Holt, A.W., Final report of the information system theory project, ()
[5] Kahn, G.; Plotkin, G.D., Domaines concret, ()
[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, ()
[8] Milne, G.; Milner, R., Concurrent processes and their syntax, J. ACM, 26, 2, 302-321, (1979) · Zbl 0395.68030
[9] Petri, C.A.; Petri, C.A., Non-sequential processes, (), 57 ff, 8
[10] Petri, C.A., General net theory. communication disciplines, () · Zbl 1027.68642
[11] Petri, C.A., Concurrency as a basis of systems thinking, Internal report, (1978), GMD-ISF-76-06
[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, (), 311-366
[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 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. 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.