Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement arises when a dependency relation on the actions (in the Mazurkiewicz sense) is used to control the inheritance of orderings from the abstract level. In this paper we present a rather simple operational semantics for dependency-based action refinement. We show the consistency of the operational with a (previously published) denotational semantics. We moreover show that bisimulation is a congruence for dependency-based refinement. Finally, we give an illustrative example.
|Number of pages||10|
|Publication status||Published - 1997|
|Event||22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 - Bratislava, Slovakia|
Duration: 25 Aug 1997 → 29 Aug 1997
Conference number: 22
|Conference||22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997|
|Period||25/08/97 → 29/08/97|