Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
Abstract elided by the publisher.
Related papers
- Binary Reachability Analysis of Discrete Pushdown Timed Automata CAV 2000
- Revisiting Underapproximate Reachability for Multipushdown Systems TACAS 2020
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016
- Model Checking via Reachability Testing for Timed Automata TACAS 1998
- Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata CAV 2021
- Monitoring CTMCs by Multi-clock Timed Automata CAV 2018
- Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time TACAS 1997
- Efficient Timed Reachability Analysis Using Clock Difference Diagrams CAV 1999