1246 search results - page 31 / 250 » Recursive Timed Automata |
93
Voted
HYBRID
1995
Springer
15 years 4 months ago
1995
Springer
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite automata and linear systems, developed by the author...
102
Voted
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
PODS
2007
ACM
16 years 24 days ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
88
Voted
FORMATS
2010
Springer
14 years 10 months ago
2010
Springer
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.
86
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...