In this paper, we apply a compositional proof technique to an automatic verification of the correctness of Fischer’s mutual exclusion protocol. It is demonstrated that the technique may avoid the stateexplosion problem. Our compositional technique has recently been implemented in a tool CMC5, which verifies the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In contrast all existing verification tools for timed systems will suffer from the stateexplosion problem, and no tool has to our knowledge succeeded in verifying the protocol for more than 11 processes.
CITATION STYLE
Kristoffersen, K. J., Laroussinie, F., Larsen, K. G., Pettersson, P., & Yi, W. (1997). A compositional proof of a real-time mutual exclusion protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1214, pp. 565–579). Springer Verlag. https://doi.org/10.1007/bfb0030626
Mendeley helps you to discover research relevant for your work.