Arrow Research search
Back to I&C

I&C 1993

Towards Action-Refinement in Process Algebras

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

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 intuitive manner. In fact we show that it coincides with the timed-equivalence proposed by one of the authors. We also show that it can be characterized equationally.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
971926669740774833
v2026.09.13