AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semirings: Cohen’s omega operator and a divergence operator. They are determined for various computational models, and conditions for their existence and their coincidence are given. It turns out that divergence yields a simple and natural way of modelling infinite behaviours of programs and discrete systems, whereas the omega operator shows some anomalies
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractA language is constructed that supports arbitrary atomic statements, composition, alternativ...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noet...
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...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
AbstractWe study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting o...
103 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.An (omega)-language is a set ...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
Algebraic structures, such as modal idempotent semirings or Kleene algebras, offer a large variety of...
We generalise the designs of the Unifying Theories of Programming (UTP) by defining them as matrices...
© Springer International Publishing Switzerland 2016. Over finitewords, there is a tight connection ...
We define rationally additive semirings that are a generalization of (omega-)complete and (omega-)co...
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractA language is constructed that supports arbitrary atomic statements, composition, alternativ...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noet...
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...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
AbstractWe study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting o...
103 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.An (omega)-language is a set ...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
Algebraic structures, such as modal idempotent semirings or Kleene algebras, offer a large variety of...
We generalise the designs of the Unifying Theories of Programming (UTP) by defining them as matrices...
© Springer International Publishing Switzerland 2016. Over finitewords, there is a tight connection ...
We define rationally additive semirings that are a generalization of (omega-)complete and (omega-)co...
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractA language is constructed that supports arbitrary atomic statements, composition, alternativ...