As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
Abstract elided by the publisher.
Related papers
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016
- Efficient Guiding Towards Cost-Optimality in UPPAAL TACAS 2001
- Resource-Optimal Scheduling Using Priced Timed Automata TACAS 2004
- Optimal Time-Bounded Reachability Analysis for Concurrent Systems TACAS 2019
- Indexing the extended Dyck-CFL reachability for context-sensitive program analysis OOPSLA 2022
- Abstract A* Algorithm and Its Application to Linearly Priced Timed Automata APLAS 2001
- Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata CAV 2021
- Field analysis: getting useful and low-cost interprocedural information PLDI 2000