Automated Analysis of MUTEX Algorithms with FASE

In this paper we study the liveness of several MUTEX solutions by representing them as processes in PAFASs, a CCS-like process algebra with a specific operator for modelling non-blocking reading behaviours. Verification is carried out using the tool FASE, exploiting a correspondence between violations of the liveness property and a special kind of cycles (called catastrophic cycles) in some transition system. We also compare our approach with others in the literature. The aim of this paper is twofold: on the one hand, we want to demonstrate the applicability of FASE to some concrete, meaningful examples; on the other hand, we want to study the impact of introducing non-blocking behaviours in modelling concurrent systems.

[1]  D. J. Walker,et al.  Automated analysis of mutual exclusion algorithms using CCS , 1989, Formal Aspects of Computing.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[4]  Walter Vogler,et al.  Time and Fairness in a Process Algebra with Non-blocking Reading , 2009, SOFSEM.

[5]  Gerardo Costa,et al.  Weak and Strong Fairness in CCS , 1987, Inf. Comput..

[6]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[7]  Gerardo Costa,et al.  A fair calculus of communicating systems , 1983, Acta Informatica.

[8]  Walter Vogler,et al.  Checking a Mutex Algorithm in a Process Algebra with Fairness , 2006, CONCUR.

[9]  Walter Vogler,et al.  Evaluating the Efficiency of Asynchronous Systems with FASE , 2011, ArXiv.

[10]  Walter Vogler,et al.  Comparing the worst-case efficiency of asynchronous systems with PAFAS , 2002, Acta Informatica.

[11]  N. Bogunovic,et al.  Verification of mutual exclusion algorithms with SMV system , 2003, The IEEE Region 8 EUROCON 2003. Computer as a Tool..

[12]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[13]  Walter Vogler,et al.  Measuring the performance of asynchronous systems with PAFAS , 2005, Theor. Comput. Sci..