DMCA
Generalized discrete timed automata: decidable approximations for safety verification
| Venue: | Theoretical Computer Science |
| Citations: | 4 - 4 self |
BibTeX
@ARTICLE{Dang_generalizeddiscrete,
author = {Zhe Dang and Oscar H. Ibarra and Richard A. Kemmerer},
title = {Generalized discrete timed automata: decidable approximations for safety verification},
journal = {Theoretical Computer Science},
year = {},
volume = {296},
pages = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. We consider generalized discrete timed automata with general linearrelations 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 hB; ri-crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachability under these approximations. The characteriza-tions allow us to show that the safety analysis problem is decidable for generalized discrete timed automata with unit durations and for deterministic generalizeddiscrete timed automata with parameterized durations. An example specification written in ASTRAL is used to run a number of experiments using one of theapproximation techniques. 1 Introduction As a standard model for analyzing real-time systems, timed automata [3] have receivedenormous attention during the past decade. A timed automaton can be considered as a finite automaton augmented with a finite number of clocks. The clocks can be reset orprogress at the same rate, and can be tested against clock constraints in the form of clock regions (i.e., comparisons of a clock or the difference of two clocks against an integerconstant, e.g.,
Keyphrases
generalized discrete decidable approximation safety verification clock constraint parameterized duration parameterized constant safety analysis problem unit duration binary reachability ri-crossing-bounded approximation finite number r-reset-bounded approximation example specification b-bounded approximation clock region finite automaton approximation technique standard model theapproximation technique derive automata-theoretic characterization general linearrelations receivedenormous attention real-time system deterministic generalizeddiscrete timed automaton past decade
