Testing Equivalences for Processes

Abstract Given a set of processes and a set of tests on these processes we show how to define in a natural way three different equivalences on processes. These equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.

[1]  Matthew Hennessy,et al.  A Term Model for Synchronous Processes , 1981, Inf. Control..

[2]  Philippe Darondeau,et al.  An enlarged definition and complete axiomatization of observational congruence of finite processes , 1982, Symposium on Programming.

[3]  Matthew Hennessy,et al.  Powerdomains and nondeterministic recursive definitions , 1982, Symposium on Programming.

[4]  C. A. R. Hoare,et al.  A Theory of Nondeterminism , 1980, ICALP.

[5]  Michael J. C. Gordon,et al.  The Denotational Description of Programming Languages , 1979, Springer New York.

[6]  P. Brinch-Hansen,et al.  The programming language Concurrent Pascal , 1975 .

[7]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[8]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[9]  Niklaus Wirth,et al.  Programming in Modula-2 , 1985, Texts and Monographs in Computer Science.

[10]  Irène Guessarian,et al.  Algebraic semantics , 1981, Lecture Notes in Computer Science.

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

[12]  Bruno Courcelle,et al.  Algebraic families of interpretations , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

[14]  Jean D. etc. Ichbiah.  Reference Manual for the ADA Programming Language , 1983 .

[15]  Per Brinch Hansen,et al.  Distributed processes: a concurrent programming concept , 1978, CACM.

[16]  Stephen D. Brookes,et al.  Possible futures, acceptances, refusals, and communicating processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[17]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[18]  STEPHrN L. BLOOM,et al.  Varieties of Ordered Algebras , 1976, J. Comput. Syst. Sci..

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

[20]  Henry Ledgard,et al.  Reference Manual for the ADA® Programming Language , 1983, Springer New York.

[21]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[23]  Rocco De Nicola,et al.  A Complete Set of Axioms for a Theory of Communicating Sequential Processes , 1983, FCT.

[24]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[25]  Butler W. Lampson,et al.  Experience with processes and monitors in Mesa , 1980, CACM.

[26]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

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