Sciweavers

6480 search results - page 276 / 1296
» Proximity Communication and Time
Sort
View
FORTE
2007
15 years 8 months ago
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...
Fei He, Luciano Baresi, Carlo Ghezzi, Paola Spolet...
ACTA
2010
104views more  ACTA 2010»
15 years 6 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
CONCUR
2012
Springer
13 years 9 months ago
Avoiding Shared Clocks in Networks of Timed Automata
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
Sandie Balaguer, Thomas Chatain
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
GLOBECOM
2009
IEEE
16 years 1 months ago
Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
Elzbieta Beres, Raviraj Adve