The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems

DOI10.1007/978-3-642-28332-1_6zbMath1350.68198OpenAlexW1882239865MaRDI QIDQ2890180

Jari Stenman, Mohamed Faouzi Atig, Parosh Aziz Abdulla

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Analyzing pushdown systems with stack manipulation ⋮ Verifying quantitative temporal properties of procedural programs ⋮ Data Multi-Pushdown Automata ⋮ Towards an Efficient Tree Automata based technique for Timed Systems

This page was built for publication: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems