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

DOI10.1016/J.IC.2006.10.009zbMATH Open1306.68100OpenAlexW2110783522MaRDI QIDQ2643076FDOQ2643076

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

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

Mathematics Subject Classification ID

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

Cites Work

• Symbolic model checking: \(10^{20}\) states and beyond
• A lattice-theoretical fixpoint theorem and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Verification, Model Checking, and Abstract Interpretation
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
• Decidability of DPDA equivalence
• Results on the propositional \(\mu\)-calculus
• On model checking for the \(\mu\)-calculus and its fragments
• Title not available (Why is that?)
• Tableau-based model checking in the propositional mu-calculus
• Property preserving abstractions for the verification of concurrent systems
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation
• Title not available (Why is that?)
• Abstraction for branching time properties.

Cited In (14)

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

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)