Order and metric in the stream semantics of elemental concurrency

SummaryTwo denotational semantics for a language with simple concurrency are presented. The language has parallel composition in the form of the shuffle operation, in addition to the usual sequential concepts including full recursion. Two linear time models, both involving sets of finite and infinite streams, are given. The first model is order-theoretic and based on the Smyth order. The second model employs complete metric spaces. Various technical results are obtained relating the order-theoretic and metric notions. The paper culminates in the proof that the two semantics for the language considered coincide. The paper completes previous investigations of the same language, establishing the equivalence of altogether four semantic models for it.

[1]  Ernst-Rüdiger Olderog,et al.  Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency , 1985, Theor. Comput. Sci..

[2]  Manfred Broy,et al.  Fixed PointTheory for Communication and Concurrency , 1982, Formal Description of Programming Concepts.

[3]  Ernst-Rüdiger Olderog,et al.  Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency , 1987, Theor. Comput. Sci..

[4]  John-Jules Ch. Meyer,et al.  Merging Regular Processes by Means of Fixed-Point Theory , 1986, Theor. Comput. Sci..

[5]  K. D. Joshi.  Introduction to General Topology , 1983 .

[6]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[7]  Erik P. de Vink,et al.  Applications of Compactness in the Smyth Powerdomain of Streams , 1988, Theor. Comput. Sci..

[8]  Ralph-Johan Back,et al.  A Continuous Semantics for Unbounded Nondeterminism , 1983, Theor. Comput. Sci..

[9]  Ernst-Rüdiger Olderog,et al.  Transition systems, infinitary languages and the semantics of uniform concurrency , 1985, STOC '85.

[10]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[11]  R. Kuiper.  An operational semantics for bounded nondeterminism equivalent to a denotational one : (preprint) , 1981 .

[12]  Jan A. Bergstra,et al.  Linear Time and Branching Time Semantics for Recursion with Merge , 1983, Theor. Comput. Sci..

[13]  Ernst-Rüdiger Olderog,et al.  Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency , 1988, J. Comput. Syst. Sci..

[14]  Manfred Broy,et al.  A Theory for Nondeterminism, Parallelism, Communication, and Concurrency , 1986, Theor. Comput. Sci..

[15]  Ernst-Rüdiger Olderog,et al.  Contrasting Themes in the Semantics of Imperative Concurrency , 1986, Current Trends in Concurrency.

[16]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

[17]  William C. Rounds,et al.  On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces , 1985, Inf. Control..