70 search results - page 8 / 14 » Distributed Timed Automata with Independently Evolving Clock... |
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...