Fast zone-based algorithms for reachability in pushdown timed automata
From MaRDI portal
Publication:832208
DOI10.1007/978-3-030-81685-8_30zbMath1493.68181arXiv2105.13683OpenAlexW3184529758MaRDI QIDQ832208
S. Akshay, Karthik R. Prakash, Paul Gastin
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2105.13683
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theory of timed automata
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Uppaal in a nutshell
- Forward analysis of updatable timed automata
- Reachability relations of timed pushdown automata
- Checking timed Büchi automata emptiness on simulation graphs
- Dense-Timed Pushdown Automata
- Better Abstractions for Timed Automata
- Timed Pushdown Automata Revisited
- Revisiting Underapproximate Reachability for Multipushdown Systems
- Towards an Efficient Tree Automata based technique for Timed Systems
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It
- Tools and Algorithms for the Construction and Analysis of Systems
- Formal Modeling and Analysis of Timed Systems
- Fast algorithms for handling diagonal constraints in timed automata
This page was built for publication: Fast zone-based algorithms for reachability in pushdown timed automata
