When not losing is better than winning: abstraction and refinement for the full -calculus

DOI10.1016/J.IC.2006.10.009MaRDI QIDQ2643076zbMATHOpenAlexFDO

Authors Martin Lange, Martin Leucker, Sharon Shoham, Orna Grumberg

Publication date 23 August 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2006.10.009

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• Solving Games Via Three-Valued Abstraction Refinement
• Solving games via three-valued abstraction refinement
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement

Cites work

• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 1693039 (Why is no real title available?)
• scientific article; zbMATH DE number 1953032 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 1903350 (Why is no real title available?)
• scientific article; zbMATH DE number 1903358 (Why is no real title available?)
• scientific article; zbMATH DE number 2102712 (Why is no real title available?)
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
• A lattice-theoretical fixpoint theorem and its applications
• Abstraction for branching time properties.
• Decidability of DPDA equivalence
• On model checking for the \(\mu\)-calculus and its fragments
• Property preserving abstractions for the verification of concurrent systems
• Results on the propositional \(\mu\)-calculus
• Symbolic model checking: \(10^{20}\) states and beyond
• Tableau-based model checking in the propositional mu-calculus
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(14)

• Efficient Algorithms for Omega-Regular Energy Games
• Equivalences and congruences on infinite Conway games
• Solving Games Via Three-Valued Abstraction Refinement
• Improved model checking of hierarchical systems
• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
• Solving games via three-valued abstraction refinement
• Verification, Model Checking, and Abstract Interpretation
• Model checking properties on reduced trace systems
• Abstraction and abstraction refinement
• scientific article; zbMATH DE number 7559481 (Why is no real title available?)
• Compositional verification and 3-valued abstractions join forces
• A framework for compositional verification of multi-valued systems via abstraction-refinement
• An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
• Conway games, coalgebraically

This page was built for publication: When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus

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