| | |
Summary: Parameterized Verification of Infinite-state
Processes with Global Conditions
Parosh Aziz Abdulla1
parosh@it.uu.se,
Giorgio Delzanno2
giorgio@disi.unige.it, and
Ahmed Rezine1
Rezine.Ahmed@it.uu.se
1
Uppsala University, Sweden
2
Universit`a di Genova, Italy.
Abstract. We present a simple and effective approximated backward
reachability algorithm for parameterized systems with existentially and
universally quantified global conditions. The individual processes oper-
ate on unbounded local variables ranging over the natural numbers. In
addition, processes may communicate via broadcast, rendez-vous and
shared variables. We apply the algorithm to verify mutual exclusion for
complex protocols such as Lamport's bakery algorithm both with and
without atomicity conditions, a distributed version of the bakery algo-
|
