DMCA
Binary Reachability Analysis of Discrete Pushdown Timed Automata (2000)
Cached
Download Links
- [www.cs.ucsb.edu]
- [cs.ucsb.edu]
- [www.cs.ucsb.edu]
- [www.cs.ucsb.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | CAV'00, LNCS 1855 |
| Citations: | 45 - 28 self |
BibTeX
@INPROCEEDINGS{Dang00binaryreachability,
author = {Zhe Dang and Oscar H. Ibarra and Tevfik Bultan and Richard A. Kemmerer and Jianwen Su},
title = {Binary Reachability Analysis of Discrete Pushdown Timed Automata},
booktitle = {CAV'00, LNCS 1855},
year = {2000},
pages = {69--84},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A configuration of a discrete pushdown timed automaton includes a control state, finitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of configurations (ff; fi), encoded as strings, such that ff can reach fi through 0 or more transitions) can be accepted by a nondeterministic pushdown machine augmented with reversal-bounded counters (NPCM). Since discrete timed automata with integer-valued clocks can be treated as discrete pushdown timed automata without the pushdown stack, we can show that the binary reachability of a discrete timed automaton can be accepted by a nondeterministic reversal-bounded multicounter machine. Thus, the binary reachability is Presburger. By using the known fact that the emptiness problem is decidable for reversalbounded ...
Keyphrases
discrete pushdown timed automaton binary reachability discrete pushdown binary reachability analysis pushdown stack integer-valued clock reversal-bounded counter many clock value pure automata-theoretic approach control state stack word nondeterministic reversal-bounded multicounter machine nondeterministic pushdown machine emptiness problem
