Difference between revisions of "D45 Model Checking"
From Event-B
Jump to navigationJump to searchimported>Tommy |
imported>Leuschel |
||
Line 1: | Line 1: | ||
= Overview = | = Overview = | ||
{{TODO}} An overview of the work done about model checking. | {{TODO}} An overview of the work done about model checking. | ||
+ | |||
+ | Driven by SSF usage of ProB: state compression: simplify states stored and also detect common (sub-)expressions and store them only once. | ||
+ | E.g., when several states have the same same value for a given variable <tt>x</tt> then its value will only be stored once. | ||
+ | This was achieved without compromising speed. | ||
+ | |||
= Motivations = | = Motivations = | ||
{{TODO}} To be completed. | {{TODO}} To be completed. |
Revision as of 14:50, 10 February 2012
Overview
TODO An overview of the work done about model checking.
Driven by SSF usage of ProB: state compression: simplify states stored and also detect common (sub-)expressions and store them only once. E.g., when several states have the same same value for a given variable x then its value will only be stored once. This was achieved without compromising speed.
Motivations
TODO To be completed.
Choices / Decisions
TODO To be completed.
Available Documentation
TODO To be completed.
Status
TODO To be completed.