an:03854409
Zbl 0537.68036
Feldman, Yishai A.; Harel, David
A probabilistic dynamic logic
EN
J. Comput. Syst. Sci. 28, 193-215 (1984).
0022-0000
1984
j
68Q65 03B48 68Q60
completeness; dynamic logic; semantics; probabilistic programs
This paper defines a formal logic PrDL whose syntax derives from Pratt's first-order dynamic logic and whose semantics is an extension of Kozen's for probabilistic programs. An axiom system for PrDL is given and shown to be complete relative to an extension of first-order analysis. For discrete probabilities it is shown that first-order analysis actually suffices. Some precursors of this paper are \textit{J. H. Reif's} propositional version [12th ACM Symp. Theory of Computing, 8-13 (1980)] and \textit{L. Ramshaw's} semiformal system based on the Floyd-Hoare inductive assertion method [Ph. D. thesis (1981), Stanford University].
H.Nishimura