296 search results - page 11 / 60 » Linear Parametric Model Checking of Timed Automata |
141
Voted
TACAS
1998
Springer
15 years 10 months ago
1998
Springer
116
Voted
ENTCS
2002
15 years 6 months ago
2002
151
Voted
FOSSACS
2007
Springer
16 years 16 days ago
2007
Springer
175
Voted
CAV
2003
Springer
15 years 11 months ago
2003
Springer
184
Voted
SIGSOFT
2007
ACM
16 years 7 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...