Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Implementing sequentially consistent shared objects using broadcast and point-to-point communication
Journal of the ACM (JACM)
Byzantine-resistant total ordering algorithms
Information and Computation
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Rigorous design of fault-tolerant transactions for replicated database systems using event b
Rigorous Development of Complex Fault-Tolerant Systems
Specification and verification of reliability in dispatching multicast messages
The Journal of Supercomputing
| Hi-index | 0.00 |
In this paper, we present a refinement approach using Event-B to develop models of distributed system that constructs a Byzantine Causal Order on messages. Event-B is a formal method that provides a complete framework for the development of the models of distributed system. This technique consists of describing rigorously the problem in an abstract model, introducing solutions or design details in the refinement steps to obtain more concrete specifications. We assume that processes communicate by broadcast of messages and the messages broadcasted by Non-Byzantine processes are delivered in Byzantine Causal Order. Nature of processes is identified by the follows relations in the acknowledgement which is piggybacked on the messages. We have used Pro-B model checker & Animator to analyze various invariant properties of Byzantine Causal Order.