Serializability theory for replicated databases
Journal of Computer and System Sciences
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Foundations of knowledge for distributed systems
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Knowledge and implicit knowledge in a distributed environment
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems
Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems
PROGRAMMING SIMULTANEOUS ACTION USING COMMON KNOWLEDGE
PROGRAMMING SIMULTANEOUS ACTION USING COMMON KNOWLEDGE
| Hi-index | 0.00 |
The study of knowledge is of great use in distributed computer systems. It has led to better understanding of existing algorithms for such systems, as well as the development of new knowledge-based algorithms. The ability to achieve certain states of knowledge (e.g., common knowledge) provides a powerful tool for designing such algorithms. Unfortunately, it has been shown that for many systems it is impossible to achieve these states of knowledge. In this paper we consider alternative interpretations of knowledge under which these states can be achieved. We explore the notion of consistent interpretations, and show how they can be used to circumvent the known impossibility results in a number of cases. This may lead to greater applicability of knowledge-based algorithms.