Content deleted Content added
No edit summary |
expand lead |
||
(38 intermediate revisions by 22 users not shown) | |||
Line 1:
▲Abstraction Model checking is for systems where an actual representation is too complex and and a state space explosion will result in developing the model alone. So, the design undergoes a kind of translation to scaled down "abstract" version. <br />
The set of [[Variable (mathematics)|variables]] are partitioned into visible and invisible depending on their change of values. The real [[state space]] is summarized into a smaller set of the visible ones.
==Galois connected==
The real and the abstract state spaces are
That is,
<math>\eta</math>(<math>\theta</math>(abstract)) = abstract but <br/>▼
<math>theta</math>(<math>\eta</math>(real)) = <math>\supset</math> real ▼
==See also==
{{cmn|
* [[Abstract interpretation]]
* [[Automated theorem proving]]
* [[Computation tree logic]]
* [[Formal verification]]
* [[List of model checking tools]]
* [[Program analysis (computer science)]]
* [[Static code analysis]]
}}
==References==
{{Reflist}}
* {{cite journal | author=Edmund M. Clarke and Orna Grumberg and David E. Long | title=Model checking and abstraction | journal=ACM Transactions on Programming Languages and Systems| year=
[[Category:Model checking]]
|