A Probabilistic Higher-order Fixpoint Logic

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 $\mu^p$-calculus. We show that PHFL is strictly more expressive than the $\mu^p$-calculus, and that the PHFL model...

Full description

Bibliographic Details
Main Authors: Yo Mitani, Naoki Kobayashi, Takeshi Tsukada
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2021-12-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/6939/pdf