316 search results - page 1 / 64 » paste 2004 |
87
Voted
ACTA
2004
14 years 10 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...
74
Voted
CARS
2001
15 years 9 days ago
2001
PASTE
2004
ACM
15 years 4 months ago
2004
ACM
69
Voted
AIML
2004
15 years 9 days ago
2004
91
Voted
FC
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This is a brief summary of the invited lecture delivered during the conference. The interested reader is referred to [2] for more information.