921 search results - page 32 / 185 » On Interleaving in Timed Automata |
101
click to vote
HYBRID
1995
Springer
15 years 5 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...
114
click to vote
FORMATS
2006
Springer
15 years 5 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...
FORMATS
2010
Springer
14 years 12 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.
CORR
2010
Springer
14 years 11 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 ...
143
click to vote
CONCUR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...