Abstract
In this paper, we provide a behavioural characterization of the class of finite, seriesparallel pomsets by showing that this simple model based on partial orders is fully-abstract with respect to the behavioural equivalence obtained by applying Abramsky's testing scenario for bisimulation equivalence, [Ab87], in all refinement contexts, [AH89]. This casts the observability of series-parallel pomsets in a purely interleaving framework. Moreover, we prove that the order structure of a series-parallel pomset is completely revealed by its set of ST-traces, [G190], and provide a complete axiomatization of ST-trace equivalence over the class of series-parallel pomsets.
This work has been carried out at the University of Sussex, Falmer (U.K.). It has been supported by a grant from the United Kingdom Science and Engineering Research Council and by the Esprit BRA project CEDISYS.
Chapter PDF
Similar content being viewed by others
Keywords
- Operational Semantic
- Testing Scenario
- Label Transition System
- Communicate Sequential Process
- Denotational Semantic
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
6 References
S. Abramsky, Observation Equivalence as a Testing Equivalence, TCS 53, pp. 225–241, 1987
L. Aceto, Full Abstraction for Series-Parallel Pomsets, Computer Science Report 1/90, University of Sussex, March 1990
L. Aceto and M. Hennessy, Towards Action-refinement in Process Algebras, Proc. 4th LICS, pp. 138–145, IEEE Computer Society Press, 1989 (Full version to appear in Information and Computation)
G. Boudol and I. Castellani, Concurrency and Atomicity, TCS 59, pp. 25–84, 1988
S. D. Brookes, C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Sequential Processes, JACM 31,3, pp. 560–599, 1984
J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, TCS 37, 1, pp. 77–121, 1985
P. Darondeau and P. Degano, Causal Trees, Proc. ICALP 89, LNCS 372, pp. 234–248, Springer-Verlag, 1989
P. Degano, R. De Nicola and U. Montanari, Partial Ordering Semantics for CCS, Technical Report TR-3/88, Università di Pisa, 1988
R. De Nicola and M. Hennessy, Testing Equivalences for Processes, TCS 34,1, pp. 83–134, 1984
J. L. Gischer, Partial Orders and the Axiomatic Theory of Shuffle, Ph. D. Thesis, Stanford University, 1984
R. van Glabbeek and U. Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions, Proc. 14th MFCS, LNCS 379, pp. 237–248, Springer-Verlag, 1988
R. van Glabbeek, The Refinement Theorem for ST-bisimulation, to appear in Proc. IFIP Working Group, Sea of Galilee, 1990.
U. Goltz, On Representing CCS Programs by Finite Petri Nets, Arbeitspapiere der GMD 290, February 1988
J. Grabowski, On Partial Languages, Fundamenta Informaticae IV.2, pp. 427–498, 1981
J.F. Groote, A New Strategy for Proving ω-Completeness applied to Process Algebra, Proceedings CONCUR '90, LNCS 458, pp. 314–331, Springer-Verlag, 1990
R. van Glabbeek and F. Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, Proc. PARLE Conference 1987, LNCS 259, Springer-Verlag, 1987
M. Hennessy, Acceptance Trees, JACM 32,4, pp. 896–928, 1985
M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988
M. Hennessy, Observing Processes, Proc. REX Workshop 88, LNCS 354, pp. 173–200, Springer-Verlag, 1988
M. Hennessy, Axiomatising Finite Concurrent Processes, SIAM Journal on Computing, October 1988
M. Hennessy and R. Milner, Algebraic Laws for Nondeterminism and Concurrency, JACM 32,1, pp. 137–161, 1985
C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985
M. Hennessy and G. Plotkin, Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS, Lecture Notes in Computer Science vol. 74, Springer-Verlag, 1979
M. Main, Trace, Failure and Testing Equivalences for Communicating Systems, International Journal of Parallel Programming 16, pp. 383–401, 1988
R. Milner, Fully Abstract Models of Typed Lambda-Calculi, TCS 4, pp. 1–22, 1977
R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science Vol. 92, Springer-Verlag, 1980
R. Milner, Calculi for Synchrony and Asynchrony, TCS 25, pp. 267–310, 1983
R. Milner, Communication and Concurrency, Prentice-Hall, 1989
F. Moller, Axioms for Concurrency, Ph. D. Thesis, University of Edinburgh, 1989
M. Nielsen, U. Engberg and K. S. Larsen, Fully Abstract Models for a Process Language with Refinement, Proc. REX Workshop 88, LNCS 354, pp. 523–548, Springer-Verlag, 1988
D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science vol. 104, Springer-Verlag, 1981
G. Plotkin, LCF Considered as a Programming Language, TCS 5, pp. 223–255, 1977
G. Plotkin, A Structural Approach to Operational Semantics, Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981
V. Pratt, Modelling Concurrency with Partial Orders, International Journal of Parallel Programming 15, pp. 33–71, 1986
W. Reisig, Petri Nets, EATCS Monographs on TCS, Springer-Verlag, 1985
A. Stoughton, Fully Abstract Models of Programming Languages, Research Notes in TCS, Pitman-Wiley, 1988
D. Taubner, The Finite Representation of Abstract Programs by Automata and Petri Nets, LNCS 369, Springer-Verlag, 1989
S. Tschantz, Languages Under Concatenation and Shuffling, Vanderbilt University Report, 1988
F. Vaandrager, Determinism → (Event Structure Isomorphism = Step Sequence Equivalence), Report CS-R8839, CWI Amsterdam, October 1988
G. Winskel, Events in Computation, Ph. D. Thesis, University of Edinburgh, 1980
G. Winskel, Event Structure Semantics for CCS and Related Languages, Proc. ICALP 82, LNCS, Springer-Verlag, 1982
G. Winskel, Event Structures, Advances in Petri Nets 1986, LNCS 255, pp. 325–392, Springer-Verlag, 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aceto, L. (1991). Full abstraction for series-parallel pomsets. In: Abramsky, S., Maibaum, T.S.E. (eds) TAPSOFT '91. CAAP 1991. Lecture Notes in Computer Science, vol 493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53982-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-53982-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53982-7
Online ISBN: 978-3-540-46563-8
eBook Packages: Springer Book Archive