Parameterized Verification of Infinite-State Processes with Global Conditions [chapter]

Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine
Computer Aided Verification  
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
more » ... ut atomicity conditions, a distributed version of the bakery algorithm, and Ricart-Agrawala's distributed mutual exclusion algorithm.
doi:10.1007/978-3-540-73368-3_17 dblp:conf/cav/AbdullaDR07 fatcat:tgstepegjfaz3lcmxlsgw5ksty