Results 1 
4 of
4
From MITL to timed automata
 PROCEEDINGS OF FORMATS. VOLUME 4202 OF LNCS
, 2006
"... We show how to transform formulae written in the realtime temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented. ..."
Abstract

Cited by 28 (5 self)
 Add to MetaCart
We show how to transform formulae written in the realtime temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented.
Checking Temporal Properties of Discrete, Timed and Continuous Behaviors Dedicated to B.A. Trakhtenbrot on his 85th Birthday
"... Words, even infinite words, have their limits. Abstract. We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropriate temporal logic and describe two such monitoring algorithms ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
Words, even infinite words, have their limits. Abstract. We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropriate temporal logic and describe two such monitoring algorithms for the realtime logic MITL. 1
iii Contents List of Tables.................................. vi
, 2004
"... Worstcase time predictions for soft realtime robotic systems by Johannes Stickel, ..."
Abstract
 Add to MetaCart
(Show Context)
Worstcase time predictions for soft realtime robotic systems by Johannes Stickel,
Locally Distributed Predicates: A Technique for Distributed Programming
, 2010
"... New research in wireless networks, sensor networks, and modular robotics has spurred renewed interest in distributed programming techniques. Distributed programming is inherently more difficult than its singlethreaded equivalent, due to the need for an executing thread of a distributed program loc ..."
Abstract
 Add to MetaCart
New research in wireless networks, sensor networks, and modular robotics has spurred renewed interest in distributed programming techniques. Distributed programming is inherently more difficult than its singlethreaded equivalent, due to the need for an executing thread of a distributed program located at one computation node to access state located at a different node. Traditionally, remote state has been aggregated or summarized using distributed snapshots or global predicate evaluation. Traditional techniques for gathering state in distributed systems may be inappropriate for largescale, sparselyconnected systems, as they are bandwidth intensive and scale poorly. We have identified a novel class of distributed predicates in such systems that we term locally distributed predicates (LDPs). These are predicates over the local neighborhood of a particular node, bounded to a finite number of communication hops. These locally distributed predicates allow a programmer to describe the state configuration of a bounded subgraph of a distributed system. In this work, we formalize locally distributed predicates, and present two algorithms for