Advertisement

Full abstraction for series-parallel pomsets

  • Luca Aceto
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)

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.

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

  1. [Ab87]
    S. Abramsky, Observation Equivalence as a Testing Equivalence, TCS 53, pp. 225–241, 1987Google Scholar
  2. [Ac90]
    L. Aceto, Full Abstraction for Series-Parallel Pomsets, Computer Science Report 1/90, University of Sussex, March 1990Google Scholar
  3. [AH89]
    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)Google Scholar
  4. [BC88]
    G. Boudol and I. Castellani, Concurrency and Atomicity, TCS 59, pp. 25–84, 1988Google Scholar
  5. [BHR84]
    S. D. Brookes, C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Sequential Processes, JACM 31,3, pp. 560–599, 1984Google Scholar
  6. [BK85]
    J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, TCS 37, 1, pp. 77–121, 1985Google Scholar
  7. [DD89]
    P. Darondeau and P. Degano, Causal Trees, Proc. ICALP 89, LNCS 372, pp. 234–248, Springer-Verlag, 1989Google Scholar
  8. [DDM88]
    P. Degano, R. De Nicola and U. Montanari, Partial Ordering Semantics for CCS, Technical Report TR-3/88, Università di Pisa, 1988Google Scholar
  9. [DH84]
    R. De Nicola and M. Hennessy, Testing Equivalences for Processes, TCS 34,1, pp. 83–134, 1984Google Scholar
  10. [Gi84]
    J. L. Gischer, Partial Orders and the Axiomatic Theory of Shuffle, Ph. D. Thesis, Stanford University, 1984Google Scholar
  11. [GG88]
    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, 1988Google Scholar
  12. [Gl90]
    R. van Glabbeek, The Refinement Theorem for ST-bisimulation, to appear in Proc. IFIP Working Group, Sea of Galilee, 1990.Google Scholar
  13. [Go88]
    U. Goltz, On Representing CCS Programs by Finite Petri Nets, Arbeitspapiere der GMD 290, February 1988Google Scholar
  14. [Gr81]
    J. Grabowski, On Partial Languages, Fundamenta Informaticae IV.2, pp. 427–498, 1981Google Scholar
  15. [Gro90]
    J.F. Groote, A New Strategy for Proving ω-Completeness applied to Process Algebra, Proceedings CONCUR '90, LNCS 458, pp. 314–331, Springer-Verlag, 1990Google Scholar
  16. [GV87]
    R. van Glabbeek and F. Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, Proc. PARLE Conference 1987, LNCS 259, Springer-Verlag, 1987Google Scholar
  17. [H85]
    M. Hennessy, Acceptance Trees, JACM 32,4, pp. 896–928, 1985Google Scholar
  18. [H88a]
    M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988Google Scholar
  19. [H88b]
    M. Hennessy, Observing Processes, Proc. REX Workshop 88, LNCS 354, pp. 173–200, Springer-Verlag, 1988Google Scholar
  20. [H88c]
    M. Hennessy, Axiomatising Finite Concurrent Processes, SIAM Journal on Computing, October 1988Google Scholar
  21. [HM85]
    M. Hennessy and R. Milner, Algebraic Laws for Nondeterminism and Concurrency, JACM 32,1, pp. 137–161, 1985Google Scholar
  22. [Hoare85]
    C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985Google Scholar
  23. [HP79]
    M. Hennessy and G. Plotkin, Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS, Lecture Notes in Computer Science vol. 74, Springer-Verlag, 1979Google Scholar
  24. [Main88]
    M. Main, Trace, Failure and Testing Equivalences for Communicating Systems, International Journal of Parallel Programming 16, pp. 383–401, 1988Google Scholar
  25. [Mil77]
    R. Milner, Fully Abstract Models of Typed Lambda-Calculi, TCS 4, pp. 1–22, 1977Google Scholar
  26. [Mil80]
    R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science Vol. 92, Springer-Verlag, 1980Google Scholar
  27. [Mil83]
    R. Milner, Calculi for Synchrony and Asynchrony, TCS 25, pp. 267–310, 1983Google Scholar
  28. [Mil89]
    R. Milner, Communication and Concurrency, Prentice-Hall, 1989Google Scholar
  29. [Mol89]
    F. Moller, Axioms for Concurrency, Ph. D. Thesis, University of Edinburgh, 1989Google Scholar
  30. [NEL88]
    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, 1988Google Scholar
  31. [Pa81]
    D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science vol. 104, Springer-Verlag, 1981Google Scholar
  32. [Pl77]
    G. Plotkin, LCF Considered as a Programming Language, TCS 5, pp. 223–255, 1977Google Scholar
  33. [Pl81]
    G. Plotkin, A Structural Approach to Operational Semantics, Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981Google Scholar
  34. [Pr86]
    V. Pratt, Modelling Concurrency with Partial Orders, International Journal of Parallel Programming 15, pp. 33–71, 1986Google Scholar
  35. [Rei85]
    W. Reisig, Petri Nets, EATCS Monographs on TCS, Springer-Verlag, 1985Google Scholar
  36. [Sto88]
    A. Stoughton, Fully Abstract Models of Programming Languages, Research Notes in TCS, Pitman-Wiley, 1988Google Scholar
  37. [Tau89]
    D. Taubner, The Finite Representation of Abstract Programs by Automata and Petri Nets, LNCS 369, Springer-Verlag, 1989Google Scholar
  38. [Ts88]
    S. Tschantz, Languages Under Concatenation and Shuffling, Vanderbilt University Report, 1988Google Scholar
  39. [Va88]
    F. Vaandrager, Determinism → (Event Structure Isomorphism = Step Sequence Equivalence), Report CS-R8839, CWI Amsterdam, October 1988Google Scholar
  40. [Win80]
    G. Winskel, Events in Computation, Ph. D. Thesis, University of Edinburgh, 1980Google Scholar
  41. [Win82]
    G. Winskel, Event Structure Semantics for CCS and Related Languages, Proc. ICALP 82, LNCS, Springer-Verlag, 1982Google Scholar
  42. [Win87]
    G. Winskel, Event Structures, Advances in Petri Nets 1986, LNCS 255, pp. 325–392, Springer-Verlag, 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Luca Aceto
    • 1
  1. 1.INRIA-Sophia AntipolisValbonne CedexFrance

Personalised recommendations