104
click to vote
FORMATS
2010
Springer
15 years 26 days 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.