516 search results - page 4 / 104 » Generalizing the Discrete Timed Automaton |
CONEXT
2007
ACM
14 years 1 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
ISCAS
1995
IEEE
14 years 1 months ago
1995
IEEE
FM
1999
Springer
14 years 2 months ago
1999
Springer
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...