Summary: Optimal Paths in Weighted Timed Automata ?
Rajeev Alur 1;2 , Salvatore La Torre 1;3 , and George J. Pappas 1
1 University of Pennsylvania
2 Bell Labs
3 Universit`a degli Studi di Salerno
e­mail: falur,pappasgg@cis.upenn.edu, latorre@seas.upenn.edu
Abstract. We consider an optimal­reachability problem for a timed au­
tomaton with respect to a linear cost function which results in a weighted
timed automaton. Our solution to this optimization problem consists of
reducing it to a (parametric) shortest­path problem in a finite directed
graph. The directed graph we construct is a refinement of the region au­
tomaton due to Alur and Dill. We present an exponential time algorithm
to solve the shortest­path problem for weighted timed automata starting
from a single state, and a doubly­exponential time algorithm to solve
this problem starting from a zone of the state space.
1 Introduction
Timed automata [AD94] are widely accepted as formal models of real­time sys­
tems: a discrete transition graph is equipped with a finite set of clock variables
so expressing timing constraints becomes possible. Automated analysis of timed
automata relies on the construction of a finite quotient of the infinite space

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences