@InProceedings{   BehrmannFehnkerHuneLarsenPetterssonRomijnVaandrager:HSCC:2001,
  Author        = "Behrmann, Gerd and Fehnker, Ansgar and Hune, Thomas and Larsen, Kim and Pettersson, Paul and Romijn, Judi and Vaandrager, Frits",
  Editor        = "Di Benedetto, Maria Domenica and Sangiovanni-Vincentelli, Alberto",
  Abstract      = "This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them.",
  Address       = "Berlin, Heidelberg",
  BookTitle     = "Hybrid Systems: Computation and Control",
  date-added    = "2021-04-29 10:52:01 +0200",
  date-modified = "2021-04-29 10:55:55 +0200",
  ISBN          = "978-3-540-45351-2",
  Pages         = "147--161",
  Publisher     = "Springer Berlin Heidelberg",
  Title         = "Minimum-Cost Reachability for Priced Time Automata",
  Year          = "2001",
  File          = "Minimum-Cost Reachability for Priced Time Automata - Behrmann2001\_Chapter\_Minimum-CostReachabilityForPri - k.pdf"
}

@InProceedings{ BehrmannFehnkerHuneLarsenPetterssonRomijnVaandrager:HSCC:2001, Author = "Behrmann, Gerd and Fehnker, Ansgar and Hune, Thomas and Larsen, Kim and Pettersson, Paul and Romijn, Judi and Vaandrager, Frits", Editor = "Di Benedetto, Maria Domenica and Sangiovanni-Vincentelli, Alberto", Abstract = "This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them.", Address = "Berlin, Heidelberg", BookTitle = "Hybrid Systems: Computation and Control", date-added = "2021-04-29 10:52:01 +0200", date-modified = "2021-04-29 10:55:55 +0200", ISBN = "978-3-540-45351-2", Pages = "147--161", Publisher = "Springer Berlin Heidelberg", Title = "Minimum-Cost Reachability for Priced Time Automata", Year = "2001", File = "Minimum-Cost Reachability for Priced Time Automata - Behrmann2001_Chapter_Minimum-CostReachabilityForPri - k.pdf" }