Automated Analysis of MUTEX Algorithms with FASE

Details Automated Analysis of MUTEX Algorithms with FASE Automated Analysis of MUTEX Algorithms with FASE

2011-06-07

arxiv.org/abs/1106.1231v1

EPTCS 54, 2011, pp. 45-59

Computer Science

Logic in Computer Science

In Proceedings GandALF 2011, arXiv:1106.0814

Scientific paper

10.4204/EPTCS.54.4

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.

Affiliated with

Also associated with

No associations

Rating

Automated Analysis of MUTEX Algorithms with FASE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automated Analysis of MUTEX Algorithms with FASE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automated Analysis of MUTEX Algorithms with FASE will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25245