Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
Abstract elided by the publisher.
Related papers
- Lazy Abstractions for Timed Automata CAV 2013
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016
- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata TACAS 2021
- Parametric Timed Broadcast Protocols VMCAI 2019
- Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata CAV 2013
- Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata CAV 2021
- Context-bounded verification of thread pools POPL 2022
- Upper Bound for the Determinization of Emerson-Lei Automata: A One-Fin Approach CAV 2026