We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Comparative analysis of metabolic pathways in different genomes can give insights into the understanding of evolutionary and organizational relationships among species. This type ...
: We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power...