Model checking using adaptive state and data abstraction

Abstract

We present a partitioning algorithm for checking ACTL specifications that distinguishes between states only if this is necessary to ascertain the specification. This algorithm is then generalized to also abstract from the variable values in the states. Here, too, the values between which the algorithm distinguishes are determined by what is needed to decide whether or not the specification holds. The resulting algorithm is being implemented in an ROBDD based model checker for VHDL/S.

Symbolic model checking for temporal-epistemic logics

“…Much of the model checking literature in plain temporal logic deals with techniques to limit the impact of this, the most prominent being partial order reductions [52,23], symmetry reductions [12,18,19], ordered-binary decision diagrams [8,47], bounded and unbounded model checking [5,48], and (predicate) abstraction [16,3]. By using partial-order reduction techniques the computational tree M S is pruned and certain provably redundant states are eliminated and/or collapsed with others depending on the formula to be checked thereby reducing the state space.…”

Translating VHDL into functional symbolic finite-state models

“…by abstracting from aspects irrelevant to establish a given property (cf. [9,12,11]), or exploiting symmetries in the model [24]. [32] discusses the construction of a transition system which performs "macro steps," i.e.…”