Abstract
In recent years, it has been established that regular model checking can be successfully applied to several parameterized verification problems. However, there are many parameterized 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.
Cite
CITATION STYLE
Fisman, D., & Pnueli, A. (2001). Beyond regular model checking (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2245, pp. 156–170). Springer Verlag. https://doi.org/10.1007/3-540-45294-x_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
