Fixpoint Guided Abstraction Refinement for Alternating Automata
From MaRDI portal
Publication:3637352
DOI10.1007/978-3-642-02979-0_19zbMATH Open1248.68295OpenAlexW2026182262MaRDI QIDQ3637352FDOQ3637352
Authors: Pierre Ganty, Nicolas Maquet, 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
Recommendations
Cites Work
- Counterexample-guided abstraction refinement for symbolic model checking
- Title not available (Why is that?)
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Alternation
- Fixpoint-Guided Abstraction Refinements
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Algorithms for Omega-Regular Games with Imperfect Information
- Improved Algorithms for the Automata-Based Approach to Model-Checking
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- From many places to few: automatic abstraction refinement for Petri nets
Cited In (8)
- Abstraction refinement for emptiness checking of alternating data automata
- Fixpoint-Guided Abstraction Refinements
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
- Title not available (Why is that?)
- Alternating automata modulo first order theories
- Antichain algorithms for finite automata
- Simplifying Alternating Automata for Emptiness Testing
- Fixed point guided abstraction refinement for alternating automata
Uses Software
This page was built for publication: Fixpoint Guided Abstraction Refinement for Alternating Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637352)
