Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods
No abstract available.
Related papers
- Fully Symbolic Model Checking for Timed Automata CAV 2011
- Applying SAT Methods in Unbounded Symbolic Model Checking CAV 2002
- Alternating Automata Modulo First Order Theories CAV 2019
- Symbolic Register Automata CAV 2019
- Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification TACAS 2025
- Abstraction Refinement Algorithms for Timed Automata CAV 2019
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking CAV 2000
- Gray-Box Fuzzing via Gradient Descent and Boolean Expression Coverage TACAS 2024