Hennessy-Milner results for probabilistic PDL
From MaRDI portal
Publication:2133481
DOI10.1016/j.entcs.2020.09.014OpenAlexW3094368848WikidataQ113317290 ScholiaQ113317290MaRDI QIDQ2133481
Fabio Zanasi, Tao Gu, Alexandra Silva
Publication date: 29 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2020.09.014
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unprovability of the logical characterization of bisimulation
- Metrics for labelled Markov processes
- A probabilistic PDL
- Semantics of probabilistic programs
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity
- Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics
- Algebraic laws for nondeterminism and concurrency
- Real Analysis and Probability
- Conditioning in probabilistic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hennessy-Milner results for probabilistic PDL