90 search results - page 3 / 18 » On Regular Temporal Logics with Past, |
ATVA
2009
Springer
13 years 10 months ago
2009
Springer
We present specification languages that naturally capture exactly the regular and -regular properties that are stutter invariant. Our specification languages are variants of the cl...
IJCAI
2007
13 years 7 months ago
2007
Reasoning about the past is of fundamental importance in several applications in computer science and artificial intelligence, including reactive systems and planning. In this pa...
DAWAK
2007
Springer
13 years 10 months ago
2007
Springer
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
CONCUR
2001
Springer
13 years 10 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...
FMCAD
2008
Springer
13 years 7 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...