Praskash Panangaden
- 1.Kei1 Birman and Thomas Joseph. Reliable communication in the presence of failures. A.C.M. Transactions on Computer Systems, 5(1), February 1987. Google Scholar
Digital Library
- 2.G. Bracha and S. Toueg. Distributed deadlock detection. Distributed Computing, 2(3)" 127-138, 1987.Google Scholar
- 3.M. Chandy and L. Lamport. Finding global states of a distributed system. A.C.M. Transactions on Computer Systems, 3(1):63-75, 1985. Google ScholarDigital Library
- 4.M Chandy and J. Misra. How processes learn. In Proceedings of the Fifth A . C. M. Symposium on Principles of Distributed Computing, pages 204-214, 1985. Google ScholarDigital Library
- 5.E.J.H. Chang. Echo algorithms: depth parallel operations on graphs. I.E.E.E. Transactions on Software Engineering, SE- 8(4):391--400, 1982.Google Scholar
- 6.J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. In Proceedings of the Third A.C.M. Symposium on Principles of Distributed Computing, pages 50-61, 1984. A revised version appears as IBM Research Report l~J 4421, Aug., 1987. Google ScholarDigital Library
- 7.J. Hintikka. Knowledge and Belie/. Cornell University Press, 1962.Google Scholar
- 8.Richard Koo and Sam Toueg. Checkpointing and rollback-recovery for distributed systems. IEEE Transactions On Software Engineering, SE-13(1):23-31, January 1987. Google ScholarDigital Library
- 9.Dexter Kozen. Results on the propositional p-calculus. Theoretical Computer Science, 27:333-354, 1983.Google ScholarCross Ref
- 10.Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the A.C.M., 21(7):558- 565, 1977. Google ScholarDigital Library
- 11.Gil Neiger and Sam Toueg. Substituting for real time and common knowledge in asynchronous distributed systems. In Proceedings of the Sixth A.C.M. Symposium on Principles of Distributed Computing, pages 281-293, 1987. Google ScholarDigital Library
- 12.R. Parikh and R. Ramanujam. Distributed processing and the logic of knowledge. In Proceedings of the Brooklyn College Workshop on Logics of Programs, pages 256-268, 1985. Google ScholarDigital Library
- 13.A. Tarski. A lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309 ~ 1955.Google ScholarCross Ref
Index Terms
- Concurrent common knowledge: a new definition of agreement for asynchronous systems
Recommendations
Concurrent common knowledge: defining agreement for asynchronous systems
In this paper we present a new, knowledge-theoretic definition of agreement designed for asynchronous systems. In analogy with common knowledge, it is called concurrent common knowledge. Unlike common knowledge, it is a form of agreement that is ...
Modular randomized byzantine k-set agreement in asynchronous message-passing systems
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and Networkingk-Set agreement is a central problem of fault-tolerant distributed computing. Considering a set of n processes, where up to t may commit failures, let us assume that each process proposes a value. The problem consists in defining an algorithm such that ...
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11: Proceedings of the 15th international conference on Principles of Distributed SystemsDespite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively ...
Comments