
Open access
Author
Date
2013Type
- Report
ETH Bibliography
yes
Altmetrics
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. Show more
Permanent link
https://doi.org/10.3929/ethz-a-009911716Publication status
publishedJournal / series
Technical Report / ETH Zurich, Department of Computer ScienceVolume
Publisher
Eidgenössische Technische Hochschule Zürich, Institute of Information SecuritySubject
SPECIFICATION LANGUAGES (COMPUTER SYSTEMS); Rabin’s choice coordination.; Tool support; Event-B; Probabilistic termination; Formal modelling; SPEZIFIKATIONSSPRACHEN (COMPUTERSYSTEME); SYSTEMS ANALYSIS + SYSTEMS DEVELOPMENT + SYSTEMS DESIGN (COMPUTER SYSTEMS); Herman’s probabilistic self-stabilization; SYSTEMANALYSE + SYSTEMENTWICKLUNG + SYSTEMENTWURF (COMPUTERSYSTEME); Almost-certain convergenceOrganisational unit
02150 - Dep. Informatik / Dep. of Computer Science
More
Show all metadata
ETH Bibliography
yes
Altmetrics