Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Boudol, I. Castellani: Concurrency and Atomicity, INRIA Rapports de Recherche No 748, 1987.
U. Engberg: Ph.D. Thesis, Aarhus University, Denmark, in preparation.
J. Gischer: Partial Orders and the Axiomatic Theory of Shuffle, Ph.D. Thesis, Stanford University, 1984
R. van Glabbeek, F. Vaandrager: Petri Net Models for Algebraic Theories of Concurrency, Springer LNCS 259, 224–242, 1987.
M. Hennessy: Axiomatising Finite Concurrent Processes, University of Sussex, Report No. 4/84, 1987
M. Hennessy: An Algebraic Theory of Processes, MIT Press, 1988.
K. S. Larsen: A Fully Abstract Model for a Process Algebra with Refinement, Thesis, Aarhus University, Denmark, 1988.
A. Pnueli: Linear and Branching Structures in the Semantics and Logics of Reactive Systems, Springer LNCS 194, 15–32, 1987.
V.R. Pratt: Modelling Concurrency with Partial Orders, Int. J. of Parallel Programming 15, 33–71, 1986.
G. Rozenberg, P.S. Thiagarajan: Petri Nets: Basic Notions, Structure, Behaviour, Springer LNCS, 224, 585–668, 1985.
P.H. Starke: Processes in Petri Nets, EIK 17, 8/9, 389–416, 1981
P.H. Starke: Traces and Semiwords, Springer LNCS, 208, 332–349, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielsen, M., Engberg, U., Larsen, K.S. (1989). Fully abstract models for a process language with refinement. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. REX 1988. Lecture Notes in Computer Science, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013034
Download citation
DOI: https://doi.org/10.1007/BFb0013034
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51080-2
Online ISBN: 978-3-540-46147-0
eBook Packages: Springer Book Archive