Generalized discrete timed automata: decidable approximations for safety verification

  • Authors:

  • Zhe Dang;Oscar H. Ibarra;Richard A. Kemmerer

  • Affiliations:

  • School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA

  • Venue:
  • Theoretical Computer Science - Computing and combinatorics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the 〈B, r〉-crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachability under these approximations. The characterizations allow us to show that the safety analysis problem is decidable for generalized discrete timed automata with unit durations and for deterministic generalized discrete timed automata with parameterized durations. An example specification written in ASTRAL is used to run a number of experiments using one of the approximation techniques.