TY - JOUR
T1 - Divide and congruence II
T2 - From decomposition of modal formulas to preservation of delay and weak bisimilarity
AU - Fokkink, Wan
AU - van Glabbeek, Rob
PY - 2017/12/1
Y1 - 2017/12/1
N2 - 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.
AB - 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.
KW - Congruence formats
KW - Modal characterisation
KW - Structural operational semantics
KW - Weak bisimilarity
UR - http://www.scopus.com/inward/record.url?scp=85032920405&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032920405&partnerID=8YFLogxK
U2 - 10.1016/j.ic.2017.10.003
DO - 10.1016/j.ic.2017.10.003
M3 - Article
AN - SCOPUS:85032920405
VL - 257
SP - 79
EP - 113
JO - Information and Computation
JF - Information and Computation
SN - 0890-5401
ER -