Derivation tree analysis for accelerated fixed-point computation

DOI10.1016/J.TCS.2011.03.020zbMATH Open1218.68102OpenAlexW1977974782MaRDI QIDQ549189FDOQ549189

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

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

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)

Cites Work

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

Cited In (4)

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

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)