On fixed point equations over commutative semirings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 296-307

  Esparza, Javier ^a   Kiefer, Stefan ^a   Luttenberger, Michael ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONVERGENCE OF NUMERICAL METHODS; DIGITAL ARITHMETIC; MATHEMATICAL MODELS;

COMMUTATIVE SEMIRINGS; FIXED POINT EQUATIONS; HOPKINS-KOZEN ACCELERATION; INTERPROCEDURAL PROGRAM ANALYSIS;

LINEAR EQUATIONS;

EID: 34548081652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_26     Document Type: Conference Paper

References (8)

1. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.
2. J. Esparza, S. Kiefer, and M. Luttenberger. On fixed point equations over commutative semirings. Technical report, 2006.
3. J. Esparza, A. Kučera, and R. Mayr. Model checking probabilistic pushdown automata. In LICS 2004. IEEE Computer Society, 2004.
4. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In STACS, pages 340-352, 2005.
5. M. W. Hopkins and D. Kozen. Parikh's theorem in commutative Kleene algebra. In Logic in Computer Science, pages 394-401, 1999.
6. D. Kozen. On Kleene algebras and closed semirings. In B. Rovan, editor, Proc. Math. Found. Comput. Sci., volume 452 of Lecture Notes in Computer Science, pages 26-47, Banska-Bystrica, Slovakia, 1990. Springer-Verlag.
7. W. Kuich. Handbook of Formal Languages, volume 1, chapter 9: Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata, pages 609-677. Springer, 1997.
8. J.M. Ortega. Numerical Analysis: A Second Course. Academic Press, New York, 1972.