Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata [chapter]

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
2014 Lecture Notes in Computer Science  
We study priced dense-timed pushdown automata that are a generalization of the classic model of pushdown automata, in the sense that they operate on real-valued clocks, and that the stack symbols have real-valued ages. Furthermore, the model allows a cost function that assigns transition costs to transitions and storage costs to stack symbols. We show that the optimal cost, i.e., the infimum of the costs of the set of runs reaching a given control state, is computable.
doi:10.1007/978-3-319-04921-2_5 fatcat:2xmr3whrxbfvrjpm3nhb6i4sta