Computing Probabilistic Bisimilarity Distances via Policy Iteration
From MaRDI portal
Publication:4608674
DOI10.4230/LIPIcs.CONCUR.2016.22zbMath1392.68316OpenAlexW2544192463MaRDI QIDQ4608674
Publication date: 21 March 2018
Full work available at URL: https://dblp.uni-trier.de/db/conf/concur/concur2016.html#TangB16
value functionpolicy iterationpseudometricprobabilistic bisimilaritysimple stochastic gamelabelled Markov chain
Stochastic games, stochastic differential games (91A15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Unnamed Item ⋮ Explainability of probabilistic bisimilarity distances for labelled Markov chains ⋮ Convex lattice equation systems ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context ⋮ Asymmetric Distances for Approximate Differential Privacy ⋮ Unnamed Item ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata