Sciweavers

WIA
2000
Springer
13 years 8 months ago
Generalizing the Discrete Timed Automaton
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
Oscar H. Ibarra, Jianwen Su
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
13 years 9 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang