Simplifying Alternating Automata for Emptiness Testing
From MaRDI portal
Simplifying Alternating Automata for Emptiness Testing
Recommendations
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
- Fixed point guided abstraction refinement for alternating automata
- Fixpoint Guided Abstraction Refinement for Alternating Automata
- Symbolic Implementation of Alternating Automata
- Abstraction refinement for emptiness checking of alternating data automata
Cites work
- A coalgebraic decision procedure for WS1S
- Abstraction refinement for emptiness checking of alternating data automata
- Alternation
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Checking finite traces using alternating automata
- Fixed point guided abstraction refinement for alternating automata
- Generalized property directed reachability
- scientific article; zbMATH DE number 1670791 (Why is no real title available?)
- scientific article; zbMATH DE number 1927558 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Lazy Abstraction with Interpolants
- Lazy automata techniques for WS1S
- String Analysis via Automata Manipulation with Logic Circuit Representation
- Succinct representation of regular languages by Boolean automata
- Weak alternating automata are not that weak
Cited in
(6)- Abstraction refinement for emptiness checking of alternating data automata
- A note on the emptiness problem for alternating finite-memory automata
- scientific article; zbMATH DE number 1759428 (Why is no real title available?)
- Reasoning About Regular Properties: A Comparative Study
- Antichain with SAT and tries
- Model-checking real-time systems: revisiting the alternating automaton route
This page was built for publication: Simplifying Alternating Automata for Emptiness Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488157)
