Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
432245 | The Journal of Logic and Algebraic Programming | 2010 | 18 Pages |
Abstract
Two 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics