AbstractKleene modules and modal Kleene algebras are applied to automatically verify refinement laws for infinite loops and separation of termination. The key concept in this analysis is divergence which, in some models, abstractly characterises that part of a state space from which infinite dynamics is possible. In other models it expresses infinite iteration. Equational axioms for divergence are introduced, and the concept is refined for different contexts. In particular it is related to Löb's formula, which describes termination in modal logics
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
In two earlier papers we derived congruence formats for weak semantics on the basis of a decompositi...
In two earlier papers we derived congruence formats for weak semantics on the basis of a decompositi...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via doma...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
In two earlier papers we derived congruence formats with regard to transition system specifications ...
In two earlier papers we derived congruence formats with regard to transition system specifications ...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via doma...
AbstractWe generalize a termination theorem in term rewriting, based on an abstract commutation tech...
This chapter analyzes the development of modal logic within the research framework formulated for a ...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
In two earlier papers we derived congruence formats for weak semantics on the basis of a decompositi...
In two earlier papers we derived congruence formats for weak semantics on the basis of a decompositi...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via doma...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
In two earlier papers we derived congruence formats with regard to transition system specifications ...
In two earlier papers we derived congruence formats with regard to transition system specifications ...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via doma...
AbstractWe generalize a termination theorem in term rewriting, based on an abstract commutation tech...
This chapter analyzes the development of modal logic within the research framework formulated for a ...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
In two earlier papers we derived congruence formats for weak semantics on the basis of a decompositi...
In two earlier papers we derived congruence formats for weak semantics on the basis of a decompositi...