Affordable Access

A Compositional Proof of a Real-Time Mutual Exclusion Protocol

Authors
  • Kristoffersen, Kåre J.
  • Laroussinie, François
  • Larsen, Kim Guldstrand
  • Pettersson, Paul
  • Yi, Wang
Publication Date
Jan 01, 1997
Source
HAL-UPMC
Keywords
Language
English
License
Unknown
External links

Abstract

In this paper, we apply a compositional proof technique to an automatic veri cation of the correctness of Fischer's mutual exclusion protocol. It is demonstrated that the technique may avoid the state{ explosion problem. Our compositional technique has recently been im- plemented in a tool CMC5, which veri es the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In contrast all existing veri cation tools for timed systems will su er from the state{ explosion problem, and no tool has to our knowledge succeeded in veri- fying the protocol for more than 11 processes.

Report this publication

Statistics

Seen <100 times