Equivalences on observable processes

The finest observable and implementable equivalence on concurrent processes is sought as part of a larger program to develop a theory of observable processes where semantics of processes are based on locally and finitely observable process behavior and all process constructs are allowed, provided their operational meaning is defined by realistically implementable transition rules. The structure of transition rules is examined, and several conditions that all realistically implementable rules should satisfy are proposed. It is shown that the ISOS contexts capture exactly the observable behavior of processes. This leads to the result that copy plus refusal equivalence is the finest implementable equivalence.<<ETX>>

[1]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

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

[3]  Rocco De Nicola,et al.  CCS without tau's , 1987, TAPSOFT, Vol.1.

[4]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[5]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

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

[7]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[8]  A. Meyer,et al.  Bisimulation can't be traced. Preliminary report , 1987 .

[9]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

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

[11]  Jan Friso Groote Transition System Specifications with Negative Premises (Extended Abstract) , 1990, CONCUR.

[12]  Albert R. Meyer,et al.  Experimenting with Process Equivalence , 1992, Theor. Comput. Sci..

[13]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[14]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[15]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..