Symbolic Model Checking by Automata Based Set Representation

Abstract

Abstract. Binary Decision Diagrams (BDDs) are normally used in symbolic state space traversal to implicitly store and manipulate sets. As small BDDs can represent very large sets, it is possible to verify huge state spaces with this methodology. However, it is also well-known that certain systems do not have a compact (polynomial sized) BDD representation. Therefore, we propose a new technique for symbolic model checking where sets are represented with automata instead of BDDs. Except for the more succinct data structure, there are no major changes in the classical algorithms used in symbolic model checking. Using our approach, it is even possible to verify systems with an infinite or parameterized state space.