Fast mu-calculus model checking when tree-width is bounded.

DOI10.1007/B11831MaRDI QIDQ5900672zbMATH OpenOpenAlexFDO

Authors Jan Obdržálek

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11831

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On model checking for the -calculus and its fragments
• A graphical \(\mu\)-calculus and local model checking.
• Model checking and boolean graphs
• Parity Games on Graphs with Medium Tree-Width
• On modal -calculus over finite graphs with small components or small tree width

Cited in

(29)

• Mu-calculus path checking
• Pushdown reachability with constant treewidth
• Solving parity games via priority promotion
• Entanglement and the complexity of directed graphs
• Faster algorithms for quantitative verification in bounded treewidth graphs
• Fixpoint logics over hierarchical structures
• Digraph width measures in parameterized algorithmics
• On modal -calculus over finite graphs with small components or small tree width
• Parameterized Algorithms for Parity Games
• Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
• From Parity and Payoff Games to Linear Programming
• Solving parity games in big steps
• Jumping robbers in digraphs
• Symmetric strategy improvement
• The Descriptive Complexity of Parity Games
• On digraph width measures in parameterized algorithmics
• Alternating traps in Muller and parity games
• The dag-width of directed graphs
• Parity games on undirected graphs
• Decomposition theorems and model-checking for the modal -calculus
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• _1 and the modal -calculus
• The Theory of Universal Graphs for Infinite Duration Games
• Treewidth in Verification: Local vs. Global
• Solving Parity Games in Big Steps
• Efficient interprocedural data-flow analysis using treedepth and treewidth
• An objective improvement approach to solving discounted payoff games
• An objective improvement approach to solving discounted payoff games
• Graph operations on parity games and polynomial-time algorithms

This page was built for publication: Fast mu-calculus model checking when tree-width is bounded.

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