Sergiu Hart
ABSTRACT
We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced by Ben-Ari, Pnueli and Manna and by Clarke and Emerson. The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from 0. The logic PTLf allows us to reason about finite-state sequential probabilistic programs, and the logic PTLb allows us to reason about (finite-state) concurrent probabilistic programs, without any explicit reference to the actual values of their state-transition probabilities. A generalization of the tableau method yields exponential-time decision procedures for our logics, and complete axiomatizations of them are given. Several meta-results, including the absence of a finite-model property for PTLb, and the connection between satisfiable formulae of PTLb and finite state concurrent probabilistic programs, are also discussed.
- 1.M. Ben-Ari, A. Pnueli and Z. Manna, The Temporal Logic of Branching Time, Tech. Rept., Dept. of Applied Math., Weizmann Institute of Science, 1982.Google Scholar
- 2.E.M. Clarke and E.A. Emerson, Design and Synthesis of Synchronization Protocols using Branching Time Temporal Logic, Proc. Workshop on Logics of Programs, D. Kozen (Ed.), Springer Verlag 1982. Google ScholarDigital Library
- 3.Y. Feldman and D. Harel, A Probabilistic Dynamic Logic, Proc. 14th Symp. Theory of Computing, 1982, pp. 181-195. Google ScholarDigital Library
- 4.Y. Feldman, A Decidable Propositional Probabilistic Dynamic Logic, Proc. 15th Symp. Theory of Computing, 1983, pp. 298-309. Google ScholarDigital Library
- 5.S. Hart, M. Sharir and A. Pnueli, Termination of Concurrent Probabilistic Programs, ACM Trans. Prog. Lang. and Systems. 5(1983), pp. 356-380. Google ScholarDigital Library
- 6.S. Hart and M. Sharir, Concurrent Probabilistic Programs, or: How to Schedule if You Must, Tech. Rept., School of Math. Sciences, Tel Aviv University, May 1982.Google Scholar
- 7.D. Kozen, A Probabilistic PDL, Proc. 15th Symp. Theory of Computing, 1983, pp. 291-297. Google ScholarDigital Library
- 8.S. Krauss and D. Lehmann, Decision Procedures for Time and Chance, Proc. 24th Symp. Foundations of Computer Science 1983, pp. 202-209.Google ScholarDigital Library
- 9.D. Lehmann and S. Shelah, Reasoning with Time and Chance, Information and Control 53(1983) pp. 165-198.Google Scholar
- 10.A. Pnueli, On the Extremely Fair Treatment of Probabilistic Algorithms, Proc. 15th Symp. Theory of Computing, 1983, pp. 278-290. Google ScholarDigital Library
- 11.M. Sharir, A. Pnueli and S. Hart, The Verification of Probabilistic Programs, Siam J. Computing (to appear). Google ScholarDigital Library
Index Terms
- Probabilistic temporal logics for finite and bounded models
Recommendations
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Reified Temporal Logics: An Overview
There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal ...
Arity hierarchy for temporal logics
A major result concerning temporal logics is Kamp's Theorem which states that the pair of modalities ''until'' and ''since'' is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals. The ...
Comments