Departmental Papers (CIS)

Document Type

Conference Paper

Subject Area

CPS Real-Time, CPS Formal Methods

Date of this Version

July 2004

Publication Title

Lecture Notes in Computer Science: Automata, Languages and Programming

Volume

3142

First Page

122

Last Page

133

DOI

10.1007/978-3-540-27836-8_13

Comments

From the 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004.

Abstract

Weighted timed automata are timed automata annotated with costs on locations and transitions. The optimal game-reachability problem for these automata is to find the best-cost strategy of supplying the inputs so as to ensure reachability of a target set within a specified number of iterations. The only known complexity bound for this problem is a doubly-exponential upper bound. We establish a singly-exponential upper bound and show that there exist automata with exponentially many states in a single region with pair-wise distinct optimal strategies.

Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 22 December 2005