Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency

Two ways of assigning meaning to a language with uniform concurrency are presented and compared. The language has uninterpreted elementary actions from which statements are composed using sequential composition, nondeterministic choice, parallel composition with communication, and recursion. The first semantics uses infinite streams in the sense which is a refinement of the linear time semantics of De Bakker et al. The second semantics uses the finite observations of Hoare et al., situated “in between” the divergence and readiness semantics of Olderog & Hoare. It is shown that the two models are isomorphic and that this isomorphism induces an equivalence result between the two semantics.

[1]  Amir Pnueli,et al.  A Linear-History Semantics for Languages for Distributed Programming , 1984, Theor. Comput. Sci..

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

[3]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

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

[5]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[6]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[7]  Matthew Hennessy,et al.  Synchronous and Asynchronous Experiments on Processes , 1984, Inf. Control..

[8]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[9]  Matthew Hennessy,et al.  An Algebraic Theory of Fair Asynchronous Communicating Processes , 1985, ICALP.

[10]  C. A. R. Hoare,et al.  Semantics of Nondeterminism, Concurrency, and Communication , 1979, J. Comput. Syst. Sci..

[11]  Stephen D. Brookes,et al.  On the Relationship of CCS and CSP , 1983, ICALP.

[12]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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

[14]  Manfred Broy,et al.  Applicative Real-Time Programming , 1983, IFIP Congress.

[15]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

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

[17]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

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

[19]  Gordon D. Plotkin,et al.  Dijkstras Predicate Transformers & Smyth's Power Domaine , 1979, Abstract Software Specifications.

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

[21]  Glynn Winskel,et al.  Synchronisation Trees , 1983, ICALP.