Abstract
Given a network of processes \({\cal G}\), where each process has a fixed input bit, Input(x), the disjunction problem is for each process to compute \(\mbox{\it Output\/}=\bigvee_{x\in{\cal G}}\mbox{\it Input\/}(x)\), the disjunction of all input bits in the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of Computing Machinery 17, 643–644 (1974)
Dolev, S.: Self-Stabilization. The MIT Press (2000)
Datta, A.K., Larmore, L.L., Vemula, P.: Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theoretical Computer Science 412(40), 5541–5561 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A.K., Devismes, S., Larmore, L.L. (2012). Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. In: Richa, A.W., Scheideler, C. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2012. Lecture Notes in Computer Science, vol 7596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33536-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-33536-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33535-8
Online ISBN: 978-3-642-33536-5
eBook Packages: Computer ScienceComputer Science (R0)