The minimal cost reachability problem in priced timed pushdown systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications(2012)
摘要
This paper introduces the model of priced timed pushdown systems as an extension of discrete-timed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a priced timed pushdown system and a target set of configurations, determine the minimal possible cost of any run from the initial to a target configuration. We solve the problem by reducing it to the reachability problem in standard pushdown systems.
更多查看译文
关键词
pushdown system,target configuration,standard pushdown system,multidimensional cost,discrete-timed pushdown system,minimal possible cost,cost model,minimal cost reachability problem,reachability problem,computer science
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要