Name
Abstract | ||
|---|---|---|
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. 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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.entcs.2005.10.029 | Electronic Notes in Theoretical Computer Science |
Keywords | DocType | Volume |
Structural operational semantics,modal logic,decomposition,congruence,η-bisimulation | Journal | 156 |
Issue | ISSN | Citations |
1 | 1571-0661 | 2 |
PageRank | References | Authors |
0.35 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wan Fokkink | 1 | 1089 | 88.64 |
| Rob J. Van Glabbeek | 2 | 2 | 0.35 |
| Paulien De Wind | 3 | 45 | 2.18 |