Derivation tree analysis for accelerated fixed-point computation

DOI10.1016/J.TCS.2011.03.020MaRDI QIDQ549189zbMATH OpenOpenAlexFDO

Authors Javier Esparza, Stefan Kiefer, Michael Luttenberger

Publication date 7 July 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.03.020

zbMATH Keywords

semiringsfixed-point equationsderivation trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semirings (16Y60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• Solving fixed-point equations by derivation tree analysis
• An Extension of Newton’s Method to ω-Continuous Semirings
• On Fixed Point Equations over Commutative Semirings
• scientific article; zbMATH DE number 3858387

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3770925 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1324833 (Why is no real title available?)
• scientific article; zbMATH DE number 1101590 (Why is no real title available?)
• scientific article; zbMATH DE number 1796138 (Why is no real title available?)
• scientific article; zbMATH DE number 10087 (Why is no real title available?)
• scientific article; zbMATH DE number 1412988 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• A generic approach to the static analysis of concurrent programs with procedures
• An Extension of Newton’s Method to ω-Continuous Semirings
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Efficient Computation of Throughput Values of Context-Free Languages
• Model Checking Probabilistic Pushdown Automata
• On Fixed Point Equations over Commutative Semirings
• Ordering by Divisibility in Abstract Algebras
• Precise Fixpoint Computation Through Strategy Iteration
• Process Algebra
• Process algebra for synchronous communication
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Weighted pushdown systems and their application to interprocedural dataflow analysis

Cited in

(4)

• On the balancedness of tree-to-word transducers
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• On the Balancedness of Tree-to-Word Transducers
• Solving fixed-point equations by derivation tree analysis

Describes a project that uses

Uses Software

• mCRL

This page was built for publication: Derivation tree analysis for accelerated fixed-point computation

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