Networks of Processes with Parameterized State Space

• Published in: Electronic notes in theoretical computer science Vol. 50; no. 4; pp. 386 - 400
• Main Authors: Baukus, K., Stahl, K., Bensalem, S., Lakhnech, Y.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.08.2001
• ISSN: 1571-0661; 1571-0661
• DOI: 10.1016/S1571-0661(04)00190-2

In general, the verification of parameterized networks is undecidable. In recent years there has been a lot of research to identify subclasses of parameterized systems for which certain properties are decidable. Some of the results are based on finite abstractions of the parameterized system in order to use model-checking techniques to establish those properties. In a previous paper we presented a method which allows to compute abstractions of a parameterized system modeled in the decidable logic WS1S. These WS1S systems provide an intuitive way to describe parameterized systems of finite state processes. In practice however, the processes in the network themselves are infinite because of unbounded data structures. One source of unboundedness can be the usage of a parameterized data structure. Another typical source may be the presence of structures ranging over subsets of participating processes. E.g., this is the case for group membership or distributed shared memory consistency protocols. In this paper we use deductive methods to deal with such networks where the data structure is parameterized by the number of processes and an extra parameter. We show how to derive an abstract WS1S system which can be subject to algorithmic verification. For illustration of the method we verify the correctness of a distributed shared memory consistency protocol using PVS for the deductive verification part and the tools PAX and SMV for the algorithmic part.