Fully abstract models for a process language with refinement
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.
Key wordsconcurrency change of atomicity noninterleaved models labelled partial orders semiwords full abstraction
Unable to display preview. Download preview PDF.
- G. Boudol, I. Castellani: Concurrency and Atomicity, INRIA Rapports de Recherche No 748, 1987.Google Scholar
- U. Engberg: Ph.D. Thesis, Aarhus University, Denmark, in preparation.Google Scholar
- J. Gischer: Partial Orders and the Axiomatic Theory of Shuffle, Ph.D. Thesis, Stanford University, 1984Google Scholar
- R. van Glabbeek, F. Vaandrager: Petri Net Models for Algebraic Theories of Concurrency, Springer LNCS 259, 224–242, 1987.Google Scholar
- M. Hennessy: Axiomatising Finite Concurrent Processes, University of Sussex, Report No. 4/84, 1987Google Scholar
- M. Hennessy: An Algebraic Theory of Processes, MIT Press, 1988.Google Scholar
- K. S. Larsen: A Fully Abstract Model for a Process Algebra with Refinement, Thesis, Aarhus University, Denmark, 1988.Google Scholar
- A. Pnueli: Linear and Branching Structures in the Semantics and Logics of Reactive Systems, Springer LNCS 194, 15–32, 1987.Google Scholar
- G. Rozenberg, P.S. Thiagarajan: Petri Nets: Basic Notions, Structure, Behaviour, Springer LNCS, 224, 585–668, 1985.Google Scholar
- P.H. Starke: Processes in Petri Nets, EIK 17, 8/9, 389–416, 1981Google Scholar
- P.H. Starke: Traces and Semiwords, Springer LNCS, 208, 332–349, 1985.Google Scholar