An Example of Modeling and Evaluation of a Concurrent Program Using Colored Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm

A colored generalized stochastic Petri net (CGSPN) model was used to study the correctness and performance of the Lamport concurrent algorithm to solve the mutual exclusion problem on machines lacking an atomic test and set instruction. In particular, a parametric formal proof of liveness is developed based on the structure and initial state of the model. The performance evaluation is based on a Markovian analysis that exploits the symmetries of the model to reduce the cost of the numerical solution. Both kinds of analysis are supported by efficient algorithms. The potential of the GSPN modeling technique is illustrated on an academic but nontrivial example of an application from distributed systems. >

[1]  P. Ladet,et al.  Generalized Inverses and the Calculation of Symbolic Invariants for Coloured Petri Nets , 1991 .

[2]  Donald I. Good,et al.  Principles of proving concurrent programs in Gypsy , 1979, POPL '79.

[3]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

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

[5]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[6]  J.-M. Couvreur.  The General Computation of Flows for Coloured Nets , 1989 .

[7]  Kurt Jensen,et al.  Coloured Petri nets: A high level language for system design and analysis , 1991, Applications and Theory of Petri Nets.

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

[9]  Ramon Puigjaner,et al.  Modeling Techniques and Tools for Computer Performance Evaluation , 1989, Springer US.

[10]  Marco Ajmone Marsan,et al.  Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities , 1987, PNPM.

[11]  Marc Abrams,et al.  Exact Performance Analysis of Two Distributed Processes with Multiple Synchronization Points. , 1987 .

[12]  Kurt Jensen.  Coloured Petri nets: A high level language for system design and analysis , 1989, Applications and Theory of Petri Nets.

[13]  Ajmone MarsanMarco,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984 .

[14]  Giovanni Chiola,et al.  Colored GSPN models and automatic symmetry detection , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[15]  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.

[16]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[17]  Peter J. Haas,et al.  Stochastic Petri Net Representation of Discrete Event Simulations , 1989, IEEE Trans. Software Eng..

[18]  Kang G. Shin,et al.  Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control , 1987, IEEE Transactions on Computers.

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

[20]  John Nagle,et al.  Practical program verification: automatic program proving for real-time embedded software , 1983, POPL '83.

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

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