The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
A Discipline of Programming
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Real time resource allocation in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Developing Topology Discovery in Event-B
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
A simple refinement-based method for constructing algorithms
ACM SIGCSE Bulletin
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Formal derivation of spanning trees algorithms
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Qualitative probabilistic modelling in event-B
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
Towards probabilistic modelling in event-B
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
The challenge of probabilistic event B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Development via refinement in probabilistic b: foundation and case study
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since they are integrating both distributed and probabilistic aspects. We derive proofs of synchronization algorithms relied upon the correct-by-construction paradigm; it is supported by a progressive and incremental process controlled by the refinement techniques. We illustrate our approach by examples like the handshake and the LC1 algorithms. These algorithms are designed for an asynchronous distributed network of anonymous processes which use the message-passing feature as a model for the communication.