Departmental Papers (CIS)

Date of this Version

March 2005

Document Type

Conference Paper

Comments

From the 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005.

Abstract

We consider timed automata whose clocks are imperfect. For a given perturbation error 0 < ε < 1, the perturbed language of a timed automaton is obtained by letting its clocks change at a rate within the interval [1 - ε, 1 + ε]. We show that the perturbed language of a timed automaton with a single clock can be captured by a deterministic timed automaton. This leads to a decision procedure for the language inclusion problem for systems modeled as products of 1-clock automata with imperfect clocks. We also prove that determinization and decidability of language inclusion are not possible for multi-clock automata, even with perturbation.

Subject Area

CPS Real-Time, CPS Formal Methods

Publication Source

Lecture Notes in Computer Science: Hybrid Systems: Computation and Control

Volume

3414

Start Page

70

Last Page

85

DOI

10.1007/978-3-540-31954-2_5

Copyright/Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 27 October 2005