zbMATH — the first resource for mathematics

On the semantics of concurrency: partial orders and transition systems. (English) Zbl 0614.68023
TAPSOFT ’87, Proc. Int. Conf. Software development, Pisa/Italy 1987, Vol. 1: Trees in algebra and programming, Lect. Notes Comput. Sci. 249, 123-137 (1987).
[For the entire collection see Zbl 0605.00015.]
We introduce an algebra of labelled event structures whose operations are sequential composition, sum, and parallel composition. A transition relation is defined on these objects, where at each step a process performs a labelled poset. It is claimed that the bisimulation relative to such transition systems brings out a clean distinction between concurrency and sequential non-determinism.

68N25 Theory of operating systems