Elsevier

Information and Computation

Volume 257, December 2017, Pages 79-113
Information and Computation

Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity

https://doi.org/10.1016/j.ic.2017.10.003Get rights and content
Under an Elsevier user license
open archive

Abstract

Earlier we presented a method to decompose modal formulas for processes with the internal action τ, and congruence formats for branching and η-bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that the formulas in the modal characterisation of this semantics are always decomposed into formulas that are again in this modal characterisation. In this follow-up paper the decomposition method is enhanced to deal with modal characterisations that contain a modality ϵaφ, to derive congruence formats for delay and weak bisimilarity.

Keywords

Structural operational semantics
Congruence formats
Weak bisimilarity
Modal characterisation

Cited by (0)

An extended abstract of this paper appeared as [8].

1

NICTA is funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program.