A Context Dependent Equivalence Between Processes

Abstract In recent years several equivalences between nondeterministic and concurrent processes have been proposed in order to capture different notions of the extensional behaviour of a process. Usually, the equivalences are congruences with respect to the process-constructing operations in order to support hierarchic development of systems. With the purpose of achieving more flexible hierarchic development methods, we suggest parametrizing the equivalences with information about contexts. We carry out the suggestion in full for the bisimulation equivalence, which we parameterize with a special type of context information called environments. As a main theorem we offer a useful characterization of the information ordering on environments. Also a modal characterization of the parameterized bisimulation equivalence is presented.

[1]  Joseph Sifakis,et al.  A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1984, ICALP.

[2]  Gordon Plotkin,et al.  An Operational Semantics for CSP. , 1982 .

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

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

[5]  Colin Stirling.  A Proof-Theoretic Characterization of Observational Equivalence , 1985, Theor. Comput. Sci..

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

[7]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[8]  Colin Stirling,et al.  A Complete Compositional Model Proof System for a Subset of CCS , 1985, ICALP.

[9]  Glynn Winskel,et al.  On the Composition and Decomposition of Assertions , 1984, Seminar on Concurrency.

[10]  Robin Milner,et al.  Lectures on a Calculus for Communicating Systems , 1984, Seminar on Concurrency.

[11]  Robert M. Keller,et al.  A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.

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

[13]  Glynn Winskel,et al.  A Complete System for SCCS with Modal Assertions , 1985, FSTTCS.

[14]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[15]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

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

[17]  K. Larsen.  Context-dependent bisimulation between processes , 1986 .

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

[19]  Colin Sterling,et al.  A Complete Modal Proof System for a Subset of SCCS , 1985, TAPSOFT, Vol.1.

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

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

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