90 search results - page 7 / 18 » On regular temporal logics with past |
138
click to vote
OPODIS
2003
15 years 3 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
103
click to vote
ATVA
2010
Springer
15 years 2 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...
111
click to vote
FORMATS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
103
click to vote
ASIAN
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. A coinduction-based technique to generate an optimal monitor from a Linear Temporal Logic (LTL) formula is presented in this paper. Such a monitor receives a sequence of ...
118
click to vote
LATIN
2004
Springer
15 years 7 months ago
2004
Springer
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...