DMCA
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity
Cached
Download Links
| Venue: | Inf. Comput |
| Citations: | 3 - 0 self |
BibTeX
@ARTICLE{Fokkink_divideand,
author = {Wan Fokkink and Rob Van Glabbeek and Paulien De Wind},
title = {Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity},
journal = {Inf. Comput},
year = {},
pages = {59--85}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We present a method for decomposing modal formulas for processes with the internal action τ . To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for two weak and rooted weak semantics: branching and η-bisimilarity.
