888 search results - page 35 / 178 » The Power of Temporal Proofs |
TIT
2008
14 years 9 months ago
2008
In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-nod...
ECOWS
2009
Springer
15 years 4 months ago
2009
Springer
—Current Web service composition approaches and languages such as WS-BPEL do not allow to define temporal constraints in a declarative and separate way. Also it is not possible ...
AIPS
2009
14 years 11 months ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
114
click to vote
FMCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...