Sciweavers

3793 search results - page 163 / 759
» The wireless synchronization problem
Sort
View
FOCS
1993
IEEE
15 years 8 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
15 years 7 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
CONCUR
2005
Springer
15 years 5 months ago
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
Pedro R. D'Argenio, Biniam Gebremichael
SIROCCO
2007
15 years 5 months ago
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
Rastislav Kralovic, Richard Královic
COMCOM
2004
94views more  COMCOM 2004»
15 years 3 months ago
The timely token protocol
The token protocols in FDDI and FDDI-M support synchronous and asynchronous traffic. However, FDDI suffers from a token-lateness problem, and FDDI-M may starve asynchronous traffi...
Jorge Arturo Cobb, Miaohua Lin