Concurrency, modularity, and synchronization. (English) Zbl 0755.68098

Mathematical foundations of computer science, Proc. 14th Symp., MFCS ’89, Porąbka-Kozubnik/Pol. 1989, Lect. Notes Comput. Sci. 379, 577-598 (1989).
Summary: [For the entire collection see Zbl 0726.00018.]
There is a number of methods used for concurrent systems behaviour description. An algebra of place-transition nets is defined and chosen as a concurrent system description language; on the other hand, algebras of strings, of pomsets and of so-called multitrees, are presented and serve as examples of semantics algebras. The behaviour is then defined as a mapping from the description language into a semantic algebra; the behaviour is compositional (modular), if it is a homomorphism from the description language into the semantic algebra in question. In all above algebras the operation to be preserved by homomorphism is synchronization. It is claimed that the synchronization is a basic operation of composing event oriented concurrent systems. It is shown that all of these algebras have the same expressive power in describing the behaviour of nets.


68Q55 Semantics in the theory of computing
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)


Zbl 0726.00018