Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Awerbuch, R. Ostrovsky (1994)
Memory-efficient and self-stabilizing network RESET (extended abstract)
M. Gouda, F. Haddix (1999)
The alternatorDistributed Computing, 20
Moshe Vardi (1985)
Automatic verification of probabilistic concurrent finite state programs26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
R. Segala (1996)
Modeling and verification of randomized distributed real-time systems
G. Varghese (1997)
Compositional proofs of self-stabilizing protocols
R. Glabbeek, S. Smolka, B. Steffen (1990)
Reactive, generative, and stratified models of probabilistic processes[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
C. Johnen (2004)
Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
R. Segala, N. Lynch (1994)
Probabilistic Simulations for Probabilistic Processes
A. Pogosyants, R. Segala (1995)
Formal verification of timed properties of randomized distributed algorithms
M. Gouda, T. Herman (1991)
Adaptive ProgrammingIEEE Trans. Software Eng., 17
M. Duflot, L. Fribourg, C. Picaronny (2002)
Randomized dining philosophers without fairness assumptionDistributed Computing, 17
Laurent Rosaz (2000)
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
E. Anagnostou, Ran El-Yaniv (1991)
More on the Power of Random Walks: Uniform Self-Stabilizing Randomized Algorithms (Preliminary Report)
J. Beauquier, M. Potop-Butucaru, C. Johnen (1999)
Memory space requirements for self-stabilizing leader election protocols
Alain Mayer, Y. Ofek, R. Ostrovsky, M. Yung (1992)
Self-stabilizing symmetry breaking in constant-space (extended abstract)
D. Angluin (1980)
Local and global properties in networks of processors (Extended Abstract)
X. Défago, M. Potop-Butucaru, Stéphane Messika, Philippe Parvédy (2006)
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
S. Dolev, T. Herman (1999)
Parallel composition of stabilizing algorithmsProceedings 19th IEEE International Conference on Distributed Computing Systems
A. Pnueli, L. Zuck (1984)
Verification of multiprocess probabilistic protocolsDistributed Computing, 1
M. Rabin (1983)
Randomized byzantine generals24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
(1995)
Optimum probabilistic selfstabilization on uniform rings
A. Datta, M. Potop-Butucaru, S. Tixeuil (2004)
Self-Stabilizing Mutual Exclusion Under Arbitrary SchedulerComput. J., 47
Alain Mayer, R. Ostrovsky, M. Yung (1996)
Self-stabilizing algorithms for synchronous unidirectional rings
Alain Mayer, R. Ostrovsky, Y. Ofek, M. Yung (2002)
Self-Stabilizing Symmetry Breaking in Constant SpaceSIAM J. Comput., 31
M. Karaata (2001)
Self-Stabilizing Strong Fairness under Weak FairnessIEEE Trans. Parallel Distributed Syst., 12
L. Fribourg, Stéphane Messika, C. Picaronny (2004)
Coupling and self-stabilizationDistributed Computing, 18
Let st be a strategy of the protocol LE under a k-bounded scheduler. There exist st > 0 and N st 1 such that any cone of st satisses Local Convergence
S. Dolev, M. Gouda, Marco Schneider (1996)
Memory requirements for silent stabilizationActa Informatica, 36
P. Spreij (1996)
Probability and Measure, 53
S. Dolev, A. Israeli, S. Moran (1990)
Self-stabilization of dynamic systems assuming only read/write atomicityDistributed Computing, 7
G. Itkis, L. Levin (1994)
Fast and lean self-stabilizing asynchronous protocolsProceedings 35th Annual Symposium on Foundations of Computer Science
Monowar Bhuyan, D. Bhattacharyya, Hossein Homaei, Hamid Shahriari, Jiankun Hu, Yong Yu, Yi Mu, Guilin Wang, Ying Sun, Hassan Asghar, Josef Pieprzyk, Huaxiong Wang, Jun Zhang, Yang Xiang, Wanlei Zhou, Lei Ye, Lan Zhou, Vijay Varadharajan, M. Hitchens, Lein Harn, Chia-Yin Lee, Changlu Lin, Chin-Chen Chang, Yini Wang, Sheng Wen, Silvio Cesare, Erika Rosas, Olivier Marin, Xavier Bonnaire (1958)
The Computer JournalNature, 181
M. Gouda, Nicholas Multari (1991)
Stabilizing Communication ProtocolsIEEE Trans. Computers, 40
J. Beauquier, M. Potop-Butucaru, C. Johnen, J. Durand-Lose (2002)
Token-Based Self-Stabilizing Uniform AlgorithmsJ. Parallel Distributed Comput., 62
S. Dolev, A. Israeli, S. Moran (1995)
Analyzing Expected Time by Scheduler-Luck GamesIEEE Trans. Software Eng., 21
J. Beauquier, C. Johnen, Stéphane Messika (2006)
All k -Bounded Policies Are Equivalent for Self-stabilization
C. Boulinier, F. Petit, V. Villain (2004)
When graph theory helps self-stabilization
J. Durand-Lose (2000)
Randomized uniform self-stabilizing mutual exclusionInf. Process. Lett., 74
M. Potop-Butucaru, C. Johnen (2001)
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
S. Wu, S. Smolka, E. Stark (1994)
Composition and Behaviors of Probabilistic I/O Automata
L. Alfaro (1997)
Formal verification of probabilistic systems
Mikhail Nesterenko, A. Arora (1999)
Stabilization-Preserving Atomicity RefinementJ. Parallel Distributed Comput., 62
M. Potop-Butucaru, S. Tixeuil (2000)
Self-stabilizing Vertex Coloration and Arbitrary Graphs
J. Beauquier, M. Potop-Butucaru, C. Johnen (2001)
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
H. Kakugawa, M. Yamashita (1997)
Uniform and Self-Stabilizing Token Rings Allowing Unfair DaemonIEEE Trans. Parallel Distributed Syst., 8
Philippe Duchon, N. Hanusse, S. Tixeuil (2004)
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
A. Israeli, M. Jalfon (1990)
Token management schemes and random walks yield self-stabilizing mutual exclusion
C. Johnen (2002)
Service time optimal self-stabilizing token circulation protocol on anonymous undirectional rings21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings.
Ivan Christoff (1990)
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
D. Lehmann, M. Rabin (1981)
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem
B. Awerbuch, Rafail OstrovskyyAugust (2007)
Memory-eecient and Self-stabilizing Network Reset
We present a randomized self-stabilizing leader election protocol and a randomized self-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirectional rings of any size. These protocols are space optimal. We also give a formal and complete proof of these protocols. To this end, we develop a complete model for probabilistic self-stabilizing distributed systems which clearly separates the non deterministic behavior of the scheduler from the randomized behavior of the protocol. This framework includes all the necessary tools for proving the self- stabilization of a randomized distributed system: definition of a probabilistic space and definition of the self-stabilization of a randomized protocol. We also propose a new technique of scheduler management through a self-stabilizing protocol composition (cross-over composition). Roughly speaking, we force all computations to have a fairness property under any scheduler, even under an unfair one.
Distributed Computing – Springer Journals
Published: Jun 20, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.