A logic of probability with decidable model checking

Daniéle Beauquier*, Alexander Rabinovich, Anatol Slissenko

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


A predicate logic of probability, close to the logics of probability of Halpern et al., is introduced. Our main result concerns the following model-checking problem: deciding whether a given formula holds on the structure defined by a given finite probabilistic process. We show that this model-checking problem is decidable for a rather large subclass of formulas of a second-order monadic logic of probability. We discuss also the decidability of satisfiability and compare our logic of probability with the probabilistic temporal logic pCTL*.

Original languageEnglish
Pages (from-to)461-487
Number of pages27
JournalJournal of Logic and Computation
Issue number4
StatePublished - Aug 2006


  • Decidability
  • Finite Markov chain
  • Model checking
  • Predicate logic of probability


Dive into the research topics of 'A logic of probability with decidable model checking'. Together they form a unique fingerprint.

Cite this