Some Progress in the Symbolic Verification of Timed Automata
No abstract available.
Related papers
- Sound and Precise Symbolic Automata Model for Stateful Software Systems CAV 2026
- Parikh's Theorem Made Symbolic POPL 2024
- Fully Symbolic Model Checking for Timed Automata CAV 2011
- Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods CAV 2003
- Lattice-theoretic progress measures and coalgebraic model checking POPL 2016
- Alternating Automata Modulo First Order Theories CAV 2019
- Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification SAS 2007
- Symbolic Quantitative Robustness Analysis of Timed Automata TACAS 2015