A Determinizable Class of Timed Automata
No abstract available.
Related papers
- Polynomial Identification of ømega-Automata TACAS 2020
- Revisiting Underapproximate Reachability for Multipushdown Systems TACAS 2020
- Suspension Automata: A Decidable Class of Hybrid Automata CAV 1994
- Active Learning of Deterministic Timed Automata with Myhill-Nerode Style Characterization CAV 2023
- Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming VMCAI 2010
- On Learning Polynomial Recursive Programs POPL 2024
- Towards Efficient Matching of Regexes with Backreferences using Register Set Automata PLDI 2026
- Reduction of Nondeterministic Tree Automata TACAS 2016