Event-B Qualitative Probability User Guide: Difference between revisions
From Event-B
Jump to navigationJump to search
imported>Son |
imported>Son m →Model |
||
| Line 32: | Line 32: | ||
=== Model === | === Model === | ||
* Boolean variables <math>x</math> and <math>y</math> represent the choice for each process: <math>TRUE</math> for short delay <math>FALSE</math> for long delay. | * Boolean variables <math>x</math> and <math>y</math> represent the choice for each process: <math>TRUE</math> for short delay <math>FALSE</math> for long delay. | ||
* Resolving contention is model as an event of the model | * Resolving contention is model as an event of the model with guard <math>x = y</math> (i.e. keep trying when the choices are identical) | ||
Revision as of 12:59, 23 November 2011
User:Son at ETH Zurich is in charge of the plug-in.
Introduction
Event-B Qualitative Probability plug-in provides supports for reasoning about termination with probability 1 (almost-certain termination).
Installing and Updating
The plug-in is available through the main Rodin Update Site under Modelling Extension category.
News
- 23.11.2011: Version 0.2.1 released for Rodin 2.3.*
Technical References
- S. Hallerstede, T.S. Hoang. Qualitative Probabilistic Modelling in Event-B. In IFM 2007: Integrated Formal Methods, 6th International Conference Proceedings, Oxford, UK, July 2-5, 2007, volume 4591 of LNCS © Springer-Verlag. Springer website
- Initial idea about probabilistic convergence event.
- New modelling elements: Variant bound
- New proof obligations: PRV, BND, FINACT.
- Example: Resolve contention in IEEE 1395 (Firewire protocol).
- E. Yilmaz, T.S. Hoang. Development of Rabin’s Choice Coordination Algorithm in Event-B. In Automated Verification of Critical Systems 2010, volume 35 of Electronic Communications of the EASST © EASST. EASST website
- Probablistic convergence event with refinement
- Constraints on how (not-) to refine probabilistic events.
- Example: Rabin's Choice Coordination Algorithm.
Usage
We illustrate the usage of the plug-in using the example of contention resolving (part of IEEE 1394 Firewire protocol).
Description
Two processes in contention use a probabilistic protocol to resolve the problem. In each step, each process probabilisitcally choose to communicate in either short or long delay. The contention is resolved when the processes choose different delays.
Model
- Boolean variables
and 
represent the choice for each process: 
for short delay 
for long delay. - Resolving contention is model as an event of the model with guard
(i.e. keep trying when the choices are identical)
