Abstract model checking: Difference between revisions

Revision as of 17:32, 26 January 2007

Latest revision as of 06:36, 31 May 2024

(43 intermediate revisions by 23 users not shown)

Line 1:

AbstractionIn Model[[computer science]] and in [[mathematics]], '''abstraction model checking''' is a form of [[model checking]] 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.

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 abstract space, concretize it and abstract the concretized version, the result will be equal to the original. On the other hand, if you pick an element from the real space, abstract it and concretize the abstract version, the final result will be a super set of the original.

That is,

<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=19921994| volume=16 | issue=5 | pages=1512--15421512–1542 | doi=10.1145/186025.186051| citeseerx=10.1.1.79.3022 | s2cid=207884170 }}

[[Category:Model checking]]