Automated Analysis of MUTEX Algorithms with FASE

In this paper we study the liveness of several MUTEX solutions by representing them as processes in PAFAS s, 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 violati...

Full description

Saved in:
Bibliographic Details
Published inElectronic proceedings in theoretical computer science Vol. 54; no. Proc. GandALF 2011; pp. 45 - 59
Main Authors Buti, Federico, Callisto De Donato, Massimo, Corradini, Flavio, Di Berardini, Maria Rita, Vogler, Walter
Format Journal Article
LanguageEnglish
Published Open Publishing Association 04.06.2011
Online AccessGet full text

Cover

More Information
Summary:In this paper we study the liveness of several MUTEX solutions by representing them as processes in PAFAS s, 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.
ISSN:2075-2180
2075-2180
DOI:10.4204/EPTCS.54.4