Automated Analysis of MUTEX Algorithms with FASE

  title={Automated Analysis of MUTEX Algorithms with FASE},
  author={Federico Buti and Massimo Callisto De Donato and Fl{\'a}vio Corradini and Maria Rita Di Berardini and Walter Vogler},
  booktitle={International Symposium on Games, Automata, Logics and Formal Verification},
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… 

Tables from this paper

Read Operators and their Expressiveness in Process Algebras

Two different ways to enhance PAFAS, a process algebra for modelling asynchronous timed concurrent systems, with non-blocking reading actions, are studied and a number of laws that are interesting in their own right are given, and can help to find a backward translation.

Analysing Mutual Exclusion using Process Algebra with Signals

This work employs a signalling operator, which can be combined with CCS, or other process calculi, and shows that this minimal extension is expressive enough to model mutual exclusion: it confirms the correctness of Peterson's mutual exclusion algorithm for two processes, as well as Lamport's bakery algorithm, under reasonable assumptions on the underlying memory model.

Ensuring liveness properties of distributed systems: Open problems

Modelling Mutual Exclusion in a Process Algebra with Time-outs

I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when



Checking a Mutex Algorithm in a Process Algebra with Fairness

This work combines work by Walker and study the liveness property of Dekker's mutual exclusion algorithm within the process algebraic setting to demonstrate the usefulness of these results and present some results that allow to reduce the state space of the PAFAS process representing Dekkers algorithm.

Time and Fairness in a Process Algebra with Non-blocking Reading

The first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems, using as application Dekker's mutual exclusion algorithm, which satisfies MUTEX liveness already under the assumption of fairness of actions.

The Concurrency Workbench

The Concurrency Workbench is an automated tool that caters for the analysis of networks of finite-state processes expressed in Milner's Calculus of Communicating Systems and has proven a valuable aid in teaching and research.

A fair calculus of communicating systems

It is shown that rules can be given for generating just the fair sequences which avoid random assignment, which is an alternative positive approach for a subset of Milner's CCS.

Evaluating the Efficiency of Asynchronous Systems with FASE

This paper considers three implementations of a bounded buffer and uses Fase to automatically evaluate their worst-case efficiency, and contrasts the results with previous ones where the efficiency of the same implementations has already been considered.

Verification of mutual exclusion algorithms with SMV system

  • N. BogunovicE. Pek
  • Computer Science
    The IEEE Region 8 EUROCON 2003. Computer as a Tool.
  • 2003
This work demonstrates automatic verification of five algorithms by symbolic model checking by using the SMV tool which enables property specification in computation tree logic and allows us to impose fairness constraints on a model.

Measuring the performance of asynchronous systems with PAFAS

Testing Equivalences for Processes

Communication and concurrency

  • R. Milner
  • Computer Science
    PHI Series in computer science
  • 1989
This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.

Automated analysis of mutual exclusion algorithms using CCS

  • D. Walker
  • Computer Science
    Formal Aspects of Computing
  • 2005
A number of mutual exclusion algorithms are studied by representing them as agents in the Calculus of Communicating Systems and using an automated tool embodying some of the theory of the Calculus to