90 search results - page 10 / 18 » On regular temporal logics with past |
129
click to vote
AAAI
2011
14 years 1 months ago
2011
In this paper we examine the general problem of generating preferred explanations for observed behavior with respect to a model of the behavior of a dynamical system. This problem...
129
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
146
Voted
TIME
2009
IEEE
15 years 8 months ago
2009
IEEE
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...
146
click to vote
FM
2003
Springer
15 years 7 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...