516 search results - page 1 / 104 » Generalizing the Discrete Timed Automaton |
WIA
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
TCS
2002
13 years 10 months ago
2002
We describe a general automata-theoretic approach for analyzing the veri
ISAAC
2001
Springer
14 years 3 months ago
2001
Springer
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...
DEDS
1998
13 years 10 months ago
1998
We consider a class of hybrid dynamical systems and obtain conditions under which the behavior of these systems can be reduced to a finite state automaton. Specifically, we consi...
STACS
2001
Springer
14 years 3 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...