Verification of multiprocess probabilistic protocols

In this paper we demonstrate the utility of temporal logic to the formal verification of probabilistic distributed programs. The approach taken is to represent the quantitative notion of probabilistic computations by the qualitative abstraction ofextreme fairness. The method is illustrated first on the dining philosophers problem [3] and then on a new probabilistic symmetric solution to then-processes mutual exclusion problem. Two related solutions are presented corresponding to different assumptions about the granularity of a compound test.

[1]  Amir Pnueli,et al.  Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System , 1984, Theor. Comput. Sci..

[2]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[3]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[4]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.

[5]  W. Feller,et al.  An Introduction to Probability Theory and Its Application. , 1951 .

[6]  Michael O. Rabin.  N-process synchronization by 4.log2N-valued shared variable , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7]  Michael O. Rabin,et al.  The choice coordination problem , 1982, Acta Informatica.

[8]  Z. Manna,et al.  Verification of concurrent programs: a temporal proof system , 1983 .

[9]  S. Hart,et al.  Termination of Probabilistic Concurrent Programs. , 1982 .

[10]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[11]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[12]  Zohar Manna,et al.  Verification of Concurrent Programs: Temporal Proof Principles , 1981, Logic of Programs.

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

[14]  Nancy A. Lynch,et al.  Shared data requirements for implementation of mutual exclusion using a test-and-set primitive , 1978 .

[15]  Michael O. Rabin.  N-Process Synchronization by 4 log _2 N-Valued Shared Variables , 1980, FOCS.

[16]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

[17]  Edsger W. Dijkstra.  Hierarchical ordering of sequential processes , 2002 .

[18]  Micha Sharir,et al.  Termination of Probabilistic Concurrent Program , 1983, TOPL.

[19]  Alon Itai,et al.  Symmetry breaking in distributive networks , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).