21 search results - page 5 / 5 » Automata and Logics for Words and Trees over an Infinite Alp... |
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...