Abstract
We study and compare two notions of non-termination on idempotent semirings: infinite iteration and divergence. We determine them in various models and develop conditions for their coincidence. It turns out that divergence yields a simple and natural way of modelling infinite behaviour, whereas infinite iteration shows some anomalies. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Höfner, P., & Struth, G. (2008). Non-termination in idempotent semirings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4988 LNCS, pp. 206–220). Springer Verlag. https://doi.org/10.1007/978-3-540-78913-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
