Abstract
We propose a methodological approach to prove that a system guarantees to establish a property eventually with probability one. Using Event-B as our modelling language, our correctness reasoning is a combination of termination proofs in terms of probabilistic convergence and standard invariant techniques. We illustrate our approach by formalising some non-trivial algorithms, including the Duelling Cowboys, Herman’s Probabilistic Self-Stabilization and Rabin’s Choice Coordination. We extend the supporting Rodin platform of Event-B to generate appropriate proof obligations for our reasoning, then subsequently (automatically/ interactively) discharge the obligations using the built-in provers of the Rodin platform.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
