Abstraction Refinement for Emptiness Checking of Alternating Data Automata
No abstract available.
Related papers
- Alternating Automata Modulo First Order Theories CAV 2019
- Simplifying Alternating Automata for Emptiness Testing APLAS 2021
- Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction CAV 2013
- Efficient Emptiness Check for Timed Büchi Automata CAV 2010
- Lazy Automata Techniques for WS1S TACAS 2017
- Truly On-the-Fly LTL Model Checking TACAS 2005
- Antichain Algorithms for Finite Automata TACAS 2010
- Symbolic Register Automata CAV 2019