113 search results - page 1 / 23 » LTL Can Be More Succinct |
ATVA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
LICS
2002
IEEE
14 years 1 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 ...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by al...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
ATVA
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...