We study the use of sets of labelled partial orders (pomsets) as denotational models for process algebras. More specifically, we study their capability to capture degrees of nonsequentiality of processes. We present four full abstractness results. The operational equivalences are based on maximal action-sequences and step-sequences — defined for a very simple process language and its extensions with a refinement combinator (change of atomicity). The denotational models are all expressed as abstractions of a standard association of sets of labelled partial orders with processes.
CITATION STYLE
Nielsen, M., Engberg, U., & Larsen, K. S. (1989). Fully abstract models for a process language with refinement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 354 LNCS, pp. 523–548). Springer Verlag. https://doi.org/10.1007/BFb0013034
Mendeley helps you to discover research relevant for your work.