Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
426589 | Information and Computation | 2012 | 27 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics