Towards action refinement in process algebras

Abstract ory of concurrency; the symbol; represents We present a simple process algebra which supports a form of refinement of an action by a process and address the question of an appropriate equivalence relation for it. The main result of the paper is that an adequate equivalence can be defined in a very intu-itive manner and moreover can be axioma-tized in much the same way as the standard behavioural equivalences.