3 search results - page 1 / 1 » Past is for free: on the complexity of verifying linear temp... |
ACTA
2004
13 years 4 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
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...
CONCUR
2001
Springer
13 years 9 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...