Parameterized Verification of Infinite-State Processes with Global Conditions

We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The individual processes operate 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 algorithm, and Ricart-Agrawala's distributed mutual exclusion algorithm.

• Type: Conference
• Year: 2007
• Where: CAV
• Authors: Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine
• Keywords: Bakery Algorithm, CAV 2007, Hardware, Lamport's Bakery Algorithm, Mutual Exclusion Algorithm