About Semantic Action Refinement

Article type: Research Article

Authors: Darondeau, Philippe^a | Degano, Pierpaolo^{b; *}

Affiliations: [a] IRISA, Campus Universitaire de Beaulieu, F-35042 Rennes; France | [b] Dipartimento di Informatica, Corso Italia 40, I-56100 Pisa, Italy

Note: [*] Partially supported by ESPRIT Basic Research Action n∘ 3011 CEDISYS.

Abstract: 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.

DOI: 10.3233/FI-1991-14204

Journal: Fundamenta Informaticae, vol. 14, no. 2, pp. 221-234, 1991