Location of Repository

The minimal cost reachability problem in priced timed pushdown systems

By Parosh Aziz Abdulla, Mohamed Faouzi Atig and Jari Stenman

Abstract

Abstract. 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.

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.307.8353
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://user.it.uu.se/~parosh/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.