University of Leicester

computer science

Equivalences on Observable Processes,
Irek Ulidowski,
Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.


The aim of this paper is to find the finest "observable" and "implementable" equivalence on concurrent processes. This is a part of a larger programme to develop a theory of observable processes where semantics of processes are based on locally and finitely observable process behaviour, and all process constructs are allowed, provided their operational meaning is defined by realistically implementable transition rules.

Process behaviour which can be established by so-called local testing but not global testing is called locally and finitely observable. We define copy+refusal testing equivalence as indistinguishability by copy+refusal tests consisting of traces, refusals and copying, all of which are local. It is argued that copy+refusal tests are sufficient for local testing---adding any other local tests to copy+refusal tests does not increase their testing power. Hence, copy+refusal equivalence is the finest observable equivalence.

By examining the structure of transition rules we propose several conditions which all realistically implementable rules should satisfy. Using these conditions, we define the ISOS format of rules. We show that the ISOS contexts capture exactly the observable behaviour of processes---ISOS trace congruence is proved to coincide with copy+refusal equivalence. Hence, copy+refusal equivalence is also the finest implementable equivalence.

This paper is available in the pdf form.

| [University Home]|[Faculty of Science]|[MCS Home]|[CS Home]||[University Index A-Z]|[University Search]|[University Help]|

Author: Irek Ulidowski (
© University of Leicester. Last modified: 19th November 2007, 13:20:21
CS Web Maintainer.