Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata

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.

[1]  Véronique Bruyère,et al.  On the optimal reachability problem of weighted timed automata , 2007, Formal Methods Syst. Des..

[2]  Yasuhiko Minamide,et al.  Pushdown Systems with Stack Manipulation , 2013, ATVA.

[3]  Antoni Mazurkiewicz,et al.  CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.

[4]  Parosh Aziz Abdulla,et al.  Computing Optimal Coverability Costs in Priced Timed Petri Nets , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[5]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[6]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[7]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[11]  Ashutosh Trivedi,et al.  Recursive Timed Automata , 2010, ATVA.

[12]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[13]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[14]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[15]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[16]  Zhe Dang,et al.  Pushdown timed automata: a binary reachability characterization and safety verification , 2001, Theor. Comput. Sci..

[17]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.