You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Minimum-Cost Reachability for Priced Timed Automata

Fulltext:


Authors:

Gerd Berhmann , Ansgar Fehnker , Thomas Hune , Kim Guldstrand Larsen , Paul Pettersson, Judi Romijn , Frits Vaandrager

Research group:

Formal Modelling and Analysis of Embedded Systems

Publication Type:

Conference/Workshop Paper

Venue:

4th International Workwhop on Hybrid Systems: Computation and Control

Abstract

This paper introduces the model of linearly priced timed au- tomata as an extension of timed automata with prices on both transitions and locations. For this model we consider the minimum-cost reachabil- ity 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 reachabil- ity problem for ordinary timed automata to more general optimization problems like static scheduling problems. We prove decidability of this problem by o ering an algorithmic solution, which isbased on a com- bination 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.

Bibtex

@inproceedings{Berhmann2407,
author = {Gerd Berhmann and Ansgar Fehnker and Thomas Hune and Kim Guldstrand Larsen and Paul Pettersson and Judi Romijn and Frits Vaandrager},
title = {Minimum-Cost Reachability for Priced Timed Automata},
editor = {Maria Domenica Di Benedetto and Alberto Sangiovanni-Vincentelli},
pages = {147--161},
month = {March},
year = {2001},
booktitle = {4th International Workwhop on Hybrid Systems: Computation and Control},
url = {http://www.es.mdu.se/publications/2407-}
}