“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
What processes know: Definitions and proof methods
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Effects of message loss on the termination of distributed protocols
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
A characterization of eventual Byzantine agreement
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
A predicate transformer approach to knowledge and knowledge-based protocols (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Simulating synchronized clocks and common knowledge in distributed systems
Journal of the ACM (JACM)
Reasoning about knowledge
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
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards programming with knowledge expressions
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Link Between Knowledge and Communication in Faulty Distributed Systems
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
On the relationship between strand spaces and multi-agent systems
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the relationship between strand spaces and multi-agent systems
ACM Transactions on Information and System Security (TISSEC)
A Refinement Theory that Supports Reasoning About Knowledge and Time
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
| Hi-index | 0.00 |
Knowledge-based program are programs with explicit tests for knowledge. They have been used successfully in a number of applications. Sanders has pointed out what seem to be a counterintuitive property of knowledge-based programs. Roughly speaking, they do not satisfy a certain monotonicity property, while standard programs (ones without tests for knowledge) do. It is shown that there are two ways of defining the monotonicity property, which agree for standard programs. Knowledge-based programs satisfy the first, but do not satisfy the second. It is further argued by example that the fact that they do not satisfy the second is actually a feature, not a problem. Moreover, once we allow the more general class of knowledge-based specifications, standard programs do not satisfy the monotonicity property either.