A Survey of Regular Model Checking [chapter]

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
2004 Lecture Notes in Computer Science  
Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, integers, and other linear data structures. The main idea is to use regular languages as the representation of
more » ... ts of configurations, and finite-state transducers to describe transition relations. In general, the verification problems considered are all undecidable, so the work has consisted in developing semi-algorithms, and decidability results for restricted cases. This paper provides a survey of the work that has been performed so far, and some of its applications.
doi:10.1007/978-3-540-28644-8_3 fatcat:xblrrywqhzhpbfqvudbhfrl5za