Image Computation in Infinite State Model Checking

Abstract

The model checking of a counters system S often reduces to the effective computation of the set of predecessors \({\rm Pre}_S^*(X)\) of a set of integer vectors X. Because the exact computation of this set is not possible in general, we are interested in characterizing the minimal Number Decision Diagrams (NDD) [WB00] that represents the set Pre ≤ k (X). In particular, its size is proved to be just polynomially bounded in k when S is a counters system with a finite monoid [FL02], explaining why there is no exponential blow up in k.