TY - JOUR

T1 - A logic of probability with decidable model checking

AU - Beauquier, Daniéle

AU - Rabinovich, Alexander

AU - Slissenko, Anatol

PY - 2006/8

Y1 - 2006/8

N2 - 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*.

AB - 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*.

KW - Decidability

KW - Finite Markov chain

KW - Model checking

KW - Predicate logic of probability

UR - http://www.scopus.com/inward/record.url?scp=33747822842&partnerID=8YFLogxK

U2 - 10.1093/logcom/exl004

DO - 10.1093/logcom/exl004

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33747822842

VL - 16

SP - 461

EP - 487

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

SN - 0955-792X

IS - 4

ER -