The Equivalence in the DCP Model

Fournier, R. and G. von Bochmann, The equivalence in the DCP model, Theoretical Computer Science 87 (1991) 97-114. The ever increasing complexity of systems stimulates research in the area of processes equivalences. In this paper, processes are considered as black boxes, characterized by their external interactions only, and the equivalences are based on this assumption. The equivalence relation induced from the partial order defined in Johnston's model of Discrete Communicating Processes is studied with the intention of finding its place within the chain of existing equivalences (namely, trace equivalence, testing equivalence, bisimulation and observational equivalence). Unfortunately, this model does not compare easily with the others. However a modification to the original model, consisting in keeping more information within a process identifier, namely all of its immediately performable events, and explicitly writing deadlocks, gives a new equivalence relation =~-a which is finer than the original one and which has the property of being equivalent to bisimulation.

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

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

[3]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

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

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

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

[7]  Michael Thomas Sanderson,et al.  Proof techniques for CCS , 1983 .

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

[9]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

[11]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[12]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

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

[14]  Robert de B. Johnston,et al.  Automated Analysis of Discrete Communication Behavior , 1987, IEEE Transactions on Software Engineering.

[15]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .