115 search results - page 8 / 23 » Meta-Reasoning in Executable Temporal Logic |
116
click to vote
OPODIS
2003
15 years 1 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...
134
click to vote
HYBRID
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
110
click to vote
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
72
Voted
FMSD
2002
14 years 11 months ago
2002
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
CONCUR
1990
Springer
15 years 3 months ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...