Solving fixed-point equations by derivation tree analysis

DOI10.1007/978-3-642-22944-2_2MaRDI QIDQ3090856zbMATH OpenOpenAlexFDO

Authors Javier Esparza, Michael Luttenberger

Publication date 2 September 2011

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22944-2_2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Recommendations

• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• Derivation tree analysis for accelerated fixed-point computation
• An Extension of Newton’s Method to ω-Continuous Semirings
• Solving fixed point equations over complete semirings
• scientific article; zbMATH DE number 3992934

Cited in

(12)

• Shrinking timed automata
• kProbLog: an algebraic Prolog for kernel programming
• FPsolve: a generic solver for fixpoint equations over semirings
• scientific article; zbMATH DE number 7228439 (Why is no real title available?)
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• scientific article; zbMATH DE number 23838 (Why is no real title available?)
• Stochastic semantics
• Solving fixed point equations over complete semirings
• scientific article; zbMATH DE number 850633 (Why is no real title available?)
• scientific article; zbMATH DE number 1424055 (Why is no real title available?)
• Derivation tree analysis for accelerated fixed-point computation
• \textsc{FPsolve}: a generic solver for fixpoint equations over semirings

This page was built for publication: Solving fixed-point equations by derivation tree analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090856)