Fixpoint Guided Abstraction Refinement for Alternating Automata
From MaRDI portal
(Redirected from Publication:3637352)
Recommendations
Cites work
- Algorithms for Omega-Regular Games with Imperfect Information
- Alternation
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Counterexample-guided abstraction refinement for symbolic model checking
- Fixpoint-Guided Abstraction Refinements
- From many places to few: automatic abstraction refinement for Petri nets
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- Improved Algorithms for the Automata-Based Approach to Model-Checking
Cited in
(8)- Fixed point guided abstraction refinement for alternating automata
- Abstraction refinement for emptiness checking of alternating data automata
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
- Antichain algorithms for finite automata
- Fixpoint-Guided Abstraction Refinements
- scientific article; zbMATH DE number 1863179 (Why is no real title available?)
- Alternating automata modulo first order theories
- Simplifying Alternating Automata for Emptiness Testing
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)
