Fixpoint Guided Abstraction Refinement for Alternating Automata
From MaRDI portal
Publication:3637352
DOI10.1007/978-3-642-02979-0_19zbMath1248.68295MaRDI QIDQ3637352
Nicolas Maquet, Pierre Ganty, Jean-François Raskin
Publication date: 9 July 2009
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_19
68Q45: Formal languages and automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Counterexample-guided abstraction refinement for symbolic model checking
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Fixpoint-Guided Abstraction Refinements
- Alternation
- Algorithms for Omega-Regular Games with Imperfect Information
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Improved Algorithms for the Automata-Based Approach to Model-Checking