Content deleted Content added
Desertarun (talk | contribs) |
expand lead |
||
(8 intermediate revisions by 5 users not shown) | |||
Line 1:
In [[computer science]] and in [[mathematics]], '''
▲'''Abstraction Model checking''' is for systems where an actual representation is too complex in developing the model alone. So, the design undergoes a kind of translation to scaled down "abstract" version.
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 [[Galois connection|Galois connected]]. This means that if we take an element from the
That is,
Line 11 ⟶ 10:
<math>\eta</math>(<math>\theta</math>(abstract)) = abstract <br/>
<math>\theta</math>(<math>\eta</math>(real)) <math>\supseteq</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=1994| volume=16 | issue=5 | pages=1512–1542 | doi=10.1145/186025.186051| citeseerx=10.1.1.79.3022 | s2cid=207884170 }}
[[Category:Model checking]]
|