A Fullt Observational Model for Infinite Behaviours of Communicating Systems

This paper is concerned with the relation of abstraction between operational and observational models for linear time semantics of C.C.S. We construct a compositional and fully abstract model for CCS under infinite (program defined) experiments which give maximal power of separation. The construction is in two stages:

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

[2]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[3]  Maurice Nivat,et al.  Adherences of Languages , 1980, J. Comput. Syst. Sci..

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

[5]  Rocco De Nicola,et al.  Testing Equivalences and Fully Abstract Models for Communicating Processes , 1985 .

[6]  Philippe Jorrand,et al.  Specification of communicating processes and process implementation correctness , 1982 .

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

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

[9]  Samson Abramsky,et al.  Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming , 1983, FCT.

[10]  Matthew Hennessy,et al.  A Term Model for CCS , 1980, MFCS.

[11]  Jan A. Bergstra,et al.  Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..

[12]  G. Boudol,et al.  Notes on Algebraic Calculi of Processes , 1989, Logics and Models of Concurrent Systems.

[13]  Philippe Darondeau,et al.  On the Observational Semantics of Fair Parallelism , 1983, ICALP.

[14]  Philippe Darondeau.  About Fair Asynchrony , 1985, Theor. Comput. Sci..

[15]  William C. Rounds,et al.  Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees , 1983, Inf. Control..

[16]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[17]  A. W. Roscoe,et al.  An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

[18]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[19]  Matthew Hennessy,et al.  Acceptance trees , 1985, JACM.

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

[21]  B. Gamatie.  Towards Specification and Proof of Asynchronous Systems , 1986, STACS.