| | |
Summary: A Survey of Regular Model Checking
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena
Dept. of Information Technology, P.O. Box 337, S-751 05 Uppsala, Sweden
fparosh,bengt,marcusn,mayanksg@it.uu.se
Abstract. Regular model checking is being developed for algorithmic
veri cation of several classes of in nite-state systems whose con gura-
tions can be modeled as words over a nite alphabet. Examples include
parameterized systems consisting of an arbitrary number of homogeneous
nite-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 represen-
tation of sets of con gurations, and nite-state transducers to describe
transition relations. In general, the veri cation 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.
1 Introduction
A signi cant research e ort is currently being devoted to extending the appli-
cability of algorithmic veri cation to parameterized and in nite-state systems,
using approaches based on abstraction, deductive techniques, decision proce-
|
