Beyond Regular Model Checking

摘要

In recent years, it has been established that regular model checking can be successfully applied to several parameterized verification problems. However, there are many parameteried verification problems that cannot be described by regular languages, and thus cannot be verified using regular model checking. In this study we try to practice symbolic model checking using classes of languages more expressive than the regular languages. We provide three methods for the uniform verification of non-regular parameterized systems.