The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
The Generalised Substitution Language Extended to Probabilistic Programs
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Refinement Calculus, Part II: Parallel and Reactive Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Performance analysis of probabilistic action systems
Formal Aspects of Computing
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Probabilistic invariants for probabilistic machines
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
An open extensible tool environment for event-b
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
The challenge of probabilistic event B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Refinement and reachability in event_b
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Justifications for the event-b modelling notation
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
On the Purpose of Event-B Proof Obligations
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Towards probabilistic modelling in event-B
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Refinement-based verification of local synchronization algorithms
FM'11 Proceedings of the 17th international conference on Formal methods
Quantitative verification of system safety in event-B
SERENE'11 Proceedings of the Third international conference on Software engineering for resilient systems
Reasoning about liveness properties in event-B
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Formal probabilistic analysis: a higher-order logic based approach
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Probabilistic compositional reasoning for guaranteeing fault tolerance properties
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Formal probabilistic analysis of cyber-physical transportation systems
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Augmenting formal development of control systems with quantitative reliability assessment
Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems
Reasoning about almost-certain convergence properties using Event-B
Science of Computer Programming
| Hi-index | 0.00 |
Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It extends the expressiveness of Event-B allowing us to prove properties of systems that could not be formalised in Event-B before. We demonstrate this by means of a small example, part of a larger Event-B development that could not be fully proved before. An important feature of the introduced construction is that it does not complicate the existing Event-B notation or method, and can be explained without referring to the underlying more complicated probabilistic theory. The necessary theory [18] itself is briefly outlined in this article to justify the soundness of the proof obligations given. We also give a short account of alternative constructions that we explored, and rejected.