Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Object-oriented analysis and design with applications (2nd ed.)
Object-oriented analysis and design with applications (2nd ed.)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented technology for real-time systems: a practical approach using OMT and Fusion
Object-oriented technology for real-time systems: a practical approach using OMT and Fusion
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
A Discipline of Programming
| Hi-index | 0.00 |
This paper presents a way to specify, to prove, and to implement object-oriented distributed cooperative algorithms. Our method gathers together three kinds of tools or formal concepts. It is derived from the B Method. So it uses a refinement approach and a proof of each specification step. The second set of concepts comes from distributed artificial intelligence. One main aspect of parallel and distributed computation is the uncertainty of the knowledge state of other sites. To express it, an epistemic logic is used to define knowledge of sites. Finally we consider some interesting practical results of distributed algorithms research. The method defines an application from three points of view (group, object, and method levels). A particular state automata formalism is used for each specification step. Finally, a distributed spanning tree algorithm is developed.