About Semantic Action Refinement
Philippe Darondeau, Pierpaolo Degano · Fundamenta Informaticae · 1991
A notion of semantic action refinement is defined both on Synchronization Trees and on Causal Trees, a class of trees recently devised for giving a full account to causality [DD89]. The branching bisimulation, as introduced in [GW89a], is shown to be preserved under semantic action refinement. As a by-product, the axiomatization of the congruence induced by branching bisimulation which was given in [GW89a] is still valid under action refinement. Both results hold for Synchronization Trees and, with the needed extensions, for Causal Trees.