Partial orders and fully abstract models for concurrency
AbstractIn this thesis sets of labelled partial orders are employed as fundamental mathematical entities for modelling nondeterministic and concurrent processes thereby obtaining so-called noninterleaving semantics. Based on different closures of sets of labelled partial orders, simple algebraic languages are given denotational models fully abstract w.r.t. corresponding behaviourally motivated equivalences. Some of the equivalences are accompanied by adequate logics and sound axiomatisations of which one is complete.
How to Cite
Engberg, U. (1990). Partial orders and fully abstract models for concurrency. DAIMI Report Series, 19(307). https://doi.org/10.7146/dpb.v19i307.6555
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.