A probabilistic PDL

In this paper we give a probabilistic analog PPDL of Propositional Dynamic Logic. We prove a small model property and give a polynomial space decision procedure for formulas involving well-structured programs. We also give a deductive calculus and illustrate its use by calculating the expected running time of a simple random walk program.

[1]  H. H. Schaefer,et al.  Topological Vector Spaces , 1967 .

[2]  Joseph Y. Halpern,et al.  The prepositional dynamic logic of deterministic, well-structured programs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  John H. Reif.  Logics for probabilistic programming (Extended Abstract) , 1980, STOC '80.

[4]  Rohit Parikh,et al.  A Theory of Probabilistic Programs , 1983, Logic of Programs.

[5]  Yishai A. Feldman,et al.  A probabilistic dynamic logic , 1982, STOC '82.

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

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

[8]  Yishai A. Feldman,et al.  A decidable propositional probabilistic dynamic logic , 1983, STOC.

[9]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[10]  Dexter Kozen,et al.  Semantics of probabilistic programs , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  Lyle Harold Ramshaw,et al.  Formalizing the analysis of algorithms , 1979 .