Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Colored Petri Nets and Occurrence Graphs with Symmetries

In this paper, we present a computer tool for verification of distributed systems. As an example, we establish the correctness of Lamport's Fast Mutual Exclusion Algorithm. The tool implements the method of occurrence graphs with symmetries (OS-graphs) for Colored Petri Nets (CP-nets). The basic idea in the approach is to exploit the symmetries inherent in many distributed systems to construct a condensed state space. We demonstrate a significant increase in the number of states which can be analyzed. The paper is to a large extent self-contained and does not assume any prior knowledge of CP-nets (or any other kinds of Petri Nets) or OS-graphs. CP-nets and OS-graphs are not our invention. Our contribution is the development of the tool and verification of the example, demonstrating how the method of occurrence graphs with symmetries can be put into practice.

[1]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

[2]  Kurt Jensen.  Condensed state spaces for symmetrical Coloured Petri Nets , 1996, Formal Methods Syst. Des..

[3]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[4]  Lars Michael Kristensen,et al.  Finding Stubborn Sets of Coloured Petri Nets Without Unfolding , 1998, ICATPN.

[5]  Giovanni Chiola,et al.  Stochastic Well-Formed Coloured Nets and Multiprocessor Modelling Applications , 1991 .

[6]  Kurt Jensen.  Coloured Petri nets , 1986 .

[7]  Kurt Jensen,et al.  Mutual Exclusion Algorithm , 1997 .

[8]  L. C.NorrisIpDavid,et al.  Better Veri cation Through Symmetry , 1996 .

[9]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[10]  S. C. Bruell,et al.  An Example of Modeling and Evaluation of a Concurrent Program Using Colored Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm , 1992, IEEE Trans. Parallel Distributed Syst..

[11]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[12]  Hartmann J. Genrich.  Predicate/transition nets , 1987 .

[13]  Jeffrey D. Ullman.  Elements of ML programming , 1994 .

[14]  Somesh Jha,et al.  Exploiting Symmetry In Temporal Logic Model Checking , 1993, CAV.

[15]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[16]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[17]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[18]  Kurt Jensen,et al.  Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1 , 1996 .

[19]  Lars Michael Kristensen,et al.  Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm - Using Coloured Petri Nets and Occurrence Graphs with Symmetries , 1997 .

[20]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[21]  Lars Michael Kristensen,et al.  Design/CPN - A Computer Tool for Coloured Petri Nets , 1997, TACAS.

[22]  Serge Haddad,et al.  A reduction theory for coloured nets , 1988, European Workshop on Applications and Theory in Petri Nets.

[23]  Lars Michael Kristensen,et al.  Design/CPN Occurrence Graph Manual , 1996 .

[24]  A. Prasad Sistla,et al.  SMC: A Symmetry Based Model Checker for Verification of Liveness Properties , 1997, CAV.

[25]  Serge Haddad,et al.  Aggregation of states in colored stochastic Petri nets: application to a multiprocessor architecture , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[26]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[27]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[28]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[29]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[30]  Somesh Jha,et al.  Combining Partial Order and Symmetry Reductions , 1997, TACAS.

[31]  Giovanni Chiola,et al.  On Well-Formed Coloured Nets and Their Symbolic Reachability Graph , 1991 .