Bloom, Fokkink & van Glabbeek (2004) presented a method to decompose formulas from Hennessy-Milner logic with regard to a structural operational semantics specification. A term in the corresponding process algebra satisfies a Hennessy-Milner formula if and only if its subterms satisfy certain formulas, obtained by decomposing the original formula. They used this decomposition method to derive congruence formats in the realm of structural operational semantics. In this paper it is shown how this framework can be extended to specifications that include bounded lookahead in their premises. This extension is used in the derivation of a congruence format for the partial trace preorder
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present a method for decomposing modal formulas for processes with the internal action tau. To de...
Bloom, Fokkink & van Glabbeek (2004) presented a method to decompose formulas from Hennessy-Miln...
AbstractThis paper presents a method for the decomposition of HML formulas. It can be used to decide...
AbstractWe present congruence formats for η- and rooted η-bisimulation equivalence. These formats ar...
AbstractWe present a method for decomposing modal formulas for processes with the internal action τ....
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
This paper presents a method for the decomposition of HML formulae. It can be used to decide whethe...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
This paper presents a method for the decomposition of HML formulas. It can be used to decide whether...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present a method for decomposing modal formulas for processes with the internal action t. To deci...
We present a method for decomposing modal formulas for processes with the internal action τ. To deci...
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present a method for decomposing modal formulas for processes with the internal action tau. To de...
Bloom, Fokkink & van Glabbeek (2004) presented a method to decompose formulas from Hennessy-Miln...
AbstractThis paper presents a method for the decomposition of HML formulas. It can be used to decide...
AbstractWe present congruence formats for η- and rooted η-bisimulation equivalence. These formats ar...
AbstractWe present a method for decomposing modal formulas for processes with the internal action τ....
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
This paper presents a method for the decomposition of HML formulae. It can be used to decide whethe...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
This paper presents a method for the decomposition of HML formulas. It can be used to decide whether...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present a method for decomposing modal formulas for processes with the internal action t. To deci...
We present a method for decomposing modal formulas for processes with the internal action τ. To deci...
Abstract. We present a method for decomposing modal formulas for processes with the internal action ...
We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derive...
We present a method for decomposing modal formulas for processes with the internal action tau. To de...