2632 search results - page 36 / 527 » Alternating Timed Automata |
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.
CORR
2010
Springer
14 years 9 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 ...
124
click to vote
CONCUR
1999
Springer
15 years 4 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...
FOSSACS
2005
Springer
15 years 5 months ago
2005
Springer
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
ARTS
1997
Springer
15 years 4 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...