True concurrency can be traced
DOI:
https://doi.org/10.7146/dpb.v19i308.6558Abstract
In this paper 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 closures of sets of labelled partial orders, a simple algebraic language with refinement is given denotational models fully abstract w.r.t. corresponding behaviourally motivated equivalences.Downloads
Published
1990-04-01
How to Cite
Engberg, U. (1990). True concurrency can be traced. DAIMI Report Series, 19(308). https://doi.org/10.7146/dpb.v19i308.6558
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.