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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Logical Methods in Computer Science e.V.
2021-12-01
|
| Serier: | Logical Methods in Computer Science |
| Fag: | |
| Online adgang: | https://lmcs.episciences.org/6939/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|