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.
(Extended Abstract)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.J. Back, “A Continuous Semantics for Unbounded Nondeterminism,” Theoretical Computer Science 23, pp. 187–210 (1983).
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).
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).
G. Boudol and I. Castellani, “Concurrency and Atomicity,” Theoretical Computer Science 59, pp. 25–84 (1988).
M. Broy, “Theory for Nondeterminism, Parallelism, Communication and Concurrency,” Theoretical Computer Science 45, pp. 1–62 (1986).
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).
U. Engberg, Dissertation, Aarhus University. In preparation.
J. Grabowski, “On Partial Languages,” Fundamenta Informaticae IV(2), pp. 427–498 (1981).
J.-J.Ch. Meyer, Programming Calculi Based on Fixed Point Transformations: Semantics and Applications, Dissertation, Free University, Amsterdam (1985).
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).
J.-J.Ch. Meyer and E.P. de Vink, Step Semantics for ‘True’ Concurrency with Recursion, draft, 1988, to appear in Distributed Computing.
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).
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).
G.D. Plotkin, “A Powerdomain Construction,” SIAM Journal of Computing 5, pp. 452–487 (1976).
V.R. Pratt, “Modelling Concurrency with Partial Orders,” International Journal of Parallel Programming 15, pp. 33–71 (1986).
M.B. Smyth, “Power Domains,” Journal of Computer System Sciences 16, pp. 23–36 (1978).
D.A. Taubner and W. Vogler, “The Step Failure Semantics,” pp. 348–359 in Proc. STACS'87, LNCS 247, Springer (1987).
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, J.J.C., de Vink, E.P. (1989). Pomset semantics for true concurrency with synchronization and recursion. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_83
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive