153 search results - page 22 / 31 » On the Decidability of Metric Temporal Logic |
ENTCS
2008
13 years 7 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
HYBRID
1997
Springer
13 years 11 months ago
1997
Springer
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— A fully-distributed collaborative multi-target tracking framework that eliminates the need for a central data associator or a central coordinating node for wireless sen...