Modelling and Verification of Mutual Exclusion Algorithms

Abstract

This paper proposes modelling and exhaustive verification of mutual exclusion algorithms using timed automata (TA) and the popular UPPAAL toolbox. The proposal allows to check all the properties of a mutual exclusion algorithm also along the time dimension. Both the classic case of atomic read/write operations on memory cells and the non determinism of… (More)
DOI: 10.1109/DS-RT.2016.16

Topics

12 Figures and Tables

Slides referencing similar topics