Abstracting WS1S Systems to Verify Parameterized Networks

  • Kai Baukus
  • Saddek Bensalem
  • Yassine Lakhnech
  • Karsten Stahl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1785)

Abstract

We present a method that allows to verify parameterized networks of finite state processes. Our method is based on three main ideas. The first one consists in modeling an infinite family of networks by a single WS1S transition system, that is, a transition system whose variables are set (2nd-order) variables and whose transitions are described in WS1S. Then, we present methods that allow to abstract a WS1S system into a finite state system that can be model-checked. Finally, in order to verify liveness properties, we present an algorithm that allows to enrich the abstract system with strong fairness conditions while preserving safety of the abstraction. We implemented our method in a tool, called pax, and applied it to several examples.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Kai Baukus
    • 1
  • Saddek Bensalem
    • 2
  • Yassine Lakhnech
    • 2
  • Karsten Stahl
    • 1
  1. 1.Institute of Computer Science and Applied MathematicsUniversity of KielKielGermany
  2. 2.VerimagCentre EquationGièresFrance

Personalised recommendations