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
In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for sp...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
Recently, there have been several new developments in discrepancy theory based on connections to sem...
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...
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...
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
We generalise the designs of the Unifying Theories of Programming (UTP) by defining them as matrices...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractLet Rk(n) denote the number of ways of representing the integers not exceeding n as the sum ...
In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for sp...
In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for sp...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
Recently, there have been several new developments in discrepancy theory based on connections to sem...
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...
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...
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
We generalise the designs of the Unifying Theories of Programming (UTP) by defining them as matrices...
AbstractWe solve a longstanding problem by providing a denotational model for nondeterministic progr...
AbstractLet Rk(n) denote the number of ways of representing the integers not exceeding n as the sum ...
In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for sp...
In 1996 Zhou and Hansen proposed a first-order interval logic called Neighbourhood Logic (NL) for sp...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
Recently, there have been several new developments in discrepancy theory based on connections to sem...