Computing Optimal Reachability Costs In Priced Dense-Timed Pushdown Automata
LATA 2014: Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370(2014)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络