@inproceedings{d79fb3e08fc34405bec3235e1fb81bcd,
title = "Beyond regular model checking (extended abstract)",
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.",
author = "Dana Fisman and Amir Pnueli",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 ; Conference date: 13-12-2001 Through 15-12-2001",
year = "2001",
month = jan,
day = "1",
doi = "10.1007/3-540-45294-x_14",
language = "English",
isbn = "3540430024",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "156--170",
editor = "Ramesh Hariharan and V. Vinay and Madhavan Mukund",
booktitle = "FST TCS 2001",
address = "Germany",
}