DMCA
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata (0)
Cached
Download Links
- [www.eecs.wsu.edu]
- [www.eecs.wsu.edu]
- [moab.eecs.wsu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | COCOON'01, LNCS 2108 |
| Citations: | 2 - 2 self |
BibTeX
@INPROCEEDINGS{Dang_decidableapproximations,
author = {Zhe Dang and Oscar H. Ibarra and Richard A. Kemmerer},
title = {Decidable Approximations on Generalized and Parameterized Discrete Timed Automata},
booktitle = {COCOON'01, LNCS 2108},
year = {},
pages = {529--539}
}
Share
 |
 |
 |
 |
||
OpenURL
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 hB; ri-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. 1
Keyphrases
decidable approximation parameterized discrete timed automaton generalized discrete approximation technique parameterized duration r-reset-bounded approximation parameterized constant example specification derive automata-theoretic characterization safety analysis problem clock constraint unit duration b-bounded approximation general linear relation binary reachability ri-crossing-bounded approximation deterministic generalized discrete
