The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1794367
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
- scientific article; zbMATH DE number 1796156
- Computing optimal reachability costs in priced dense-timed pushdown automata
- Optimal reachability for multi-priced timed automata
- Revisiting decidability and optimum reachability for multi-priced timed automata
- Foundations of Software Science and Computational Structures
- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
- Costs and rewards in priced timed automata
- Costs and rewards in priced timed automata
Cited in
(10)- Analyzing pushdown systems with stack manipulation
- Optimal reachability for multi-priced timed automata
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- Verifying quantitative temporal properties of procedural programs
- Revisiting underapproximate reachability for multipushdown systems
- Data multi-pushdown automata
- Towards an Efficient Tree Automata based technique for Timed Systems
- Average stack cost of Büchi pushdown automata
- Computing optimal reachability costs in priced dense-timed pushdown automata
This page was built for publication: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890180)