90 search results - page 2 / 18 » On regular temporal logics with past |
LPAR
1992
Springer
13 years 10 months ago
1992
Springer
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
LICS
2002
IEEE
13 years 11 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
FORMATS
2005
Springer
13 years 11 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
ICTAC
2007
Springer
14 years 5 days ago
2007
Springer
We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as sub-expressions. Every LT...
SIGSOFT
2007
ACM
14 years 6 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...