Abstract model checking: Difference between revisions

Revision as of 05:56, 22 May 2007

Revision as of 10:18, 15 July 2007

Line 1:

{{context}}

{{Wikify|date=February 2007}}

'''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]]s 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 connected which 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,

Line 15 ⟶ 13:

==Abstraction refinement loop==

A problem with abstraction [[model checking]] is that although the abstraction simulates the real, when the abstraction does not satisfy a property, it does not mean that this property actually fails in the real model. Counter examples are checked against the real state space because we obtain "spurious" counter examples. So a part of the abstraction refinement loop is:

#Obtain the abstract model

#Model check and see if everything is ok.