Advertisement

Pomset semantics for true concurrency with synchronization and recursion

  • J. -J. Ch. Meyer
  • E. P. de Vink
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 379)

Abstract

In this paper we present a denotational semantics based on pomsets for a simple language with true concurrency, synchronization and recursion. In particular, we show how we can generalize standard techniques for stream-based linear-time interleaving models to yield continuous functions associated with the syntactic operators on the domain of sets of pomsets.

Keywords

Isomorphism Class Causality Structure Semantical Operator Sequential Composition Parallel Composition 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ba].
    R.J. Back, “A Continuous Semantics for Unbounded Nondeterminism,” Theoretical Computer Science 23, pp. 187–210 (1983).Google Scholar
  2. [BMOZ].
    J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, and J.I. Zucker, “Transition Systems, Metric Spaces and Ready Sets in the Semantics for Uniform Concurrency”, Journal of Computer System Sciences 36, pp. 158–224 (1988).Google Scholar
  3. [BRR].
    J.W. de Bakker, W.P de Roever & G. Rozenberg eds., Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for concurrency, LNCS 354 (1989).Google Scholar
  4. [BC].
    G. Boudol and I. Castellani, “Concurrency and Atomicity,” Theoretical Computer Science 59, pp. 25–84 (1988).Google Scholar
  5. [Br].
    M. Broy, “Theory for Nondeterminism, Parallelism, Communication and Concurrency,” Theoretical Computer Science 45, pp. 1–62 (1986).Google Scholar
  6. [DDM].
    P. Degano, R. De Nicola, and U. Montanari, “On the Consistency of “Truly Concurrent” Operational and Denotational Semantics,” pp. 133–141 in Proc. LICS'88, Edinburgh (1988).Google Scholar
  7. [En].
    U. Engberg, Dissertation, Aarhus University. In preparation.Google Scholar
  8. [Gr].
    J. Grabowski, “On Partial Languages,” Fundamenta Informaticae IV(2), pp. 427–498 (1981).Google Scholar
  9. [Me].
    J.-J.Ch. Meyer, Programming Calculi Based on Fixed Point Transformations: Semantics and Applications, Dissertation, Free University, Amsterdam (1985).Google Scholar
  10. [MV1].
    J.-J.Ch. Meyer and E.P. de Vink, “Applications of Compactness in the Smyth Powerdomain of Streams,” Theoretical Computer Science 57, pp. 251–282 (1988).Google Scholar
  11. [MV2].
    J.-J.Ch. Meyer and E.P. de Vink, Step Semantics for ‘True’ Concurrency with Recursion, draft, 1988, to appear in Distributed Computing.Google Scholar
  12. [NEL].
    M. Nielsen, U. Engberg, and K.F. Larsen, “Fully Abstract Models for a Process Language with Refinement,” pp. 523–548 in Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, ed. J.W. de Bakker, W.-P. de Roever & G. Rozenberg, LNCS 354 (1989).Google Scholar
  13. [OGG].
    E.-R. Olderog, U. Goltz & R. van Glabbeek eds., “Combining Compositionality and Concurrency — Summary of a GMD-Workshop, Königswinter, March 1988,” Arbeitspapiere der GMD 320, GMD (1988).Google Scholar
  14. [Pl].
    G.D. Plotkin, “A Powerdomain Construction,” SIAM Journal of Computing 5, pp. 452–487 (1976).Google Scholar
  15. [Pr].
    V.R. Pratt, “Modelling Concurrency with Partial Orders,” International Journal of Parallel Programming 15, pp. 33–71 (1986).Google Scholar
  16. [Sm].
    M.B. Smyth, “Power Domains,” Journal of Computer System Sciences 16, pp. 23–36 (1978).Google Scholar
  17. [TV].
    D.A. Taubner and W. Vogler, “The Step Failure Semantics,” pp. 348–359 in Proc. STACS'87, LNCS 247, Springer (1987).Google Scholar
  18. [Wi].
    G. Winskel, “Event Structures,” pp. 325–392 in Advances in Petri Nets 1986, Part II, ed. W. Brauer, W. Reisig & G. Rozenberg, LNCS 255, Springer (1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • J. -J. Ch. Meyer
    • 1
  • E. P. de Vink
    • 1
  1. 1.Department of Mathematics and Computer ScienceVrije UniversiteitAmsterdam

Personalised recommendations