Partial orders and fully abstract models for concurrency

  • Uffe Engberg

Abstract

In 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.

Author Biography

Uffe Engberg
Published
1990-03-01
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