摘要：We introduce PHFL, a probabilistic extension of higher-order fixpoint logic, which can also be regarded as a higher-order extension of probabilistic temporal logics such as PCTL and the μ^p-calculus. We show that PHFL is strictly more expressive than the μ^p-calculus, and that the PHFL model-checking problem for finite Markov chains is undecidable even for the μ-only, order-1 fragment of PHFL. Furthermore the full PHFL is far more expressive: we give a translation from Lubarskyâs μ-arithmetic to PHFL, which implies that PHFL model checking is Î ^1â,-hard and Σ^1â,-hard. As a positive result, we characterize a decidable fragment of the PHFL model-checking problems using a novel type system.
关键词：Probabilistic logics; higher-order fixpoint logic; model checking
