Computing probabilistic bisimilarity distances for probabilistic automata

DOI10.4230/LIPICS.CONCUR.2019.9MaRDI QIDQ5875370zbMATH OpenFDO

Authors Giorgio Bacci, Giovanni Bacci, Radu Mardare, Qiyi Tang, Kim G. Larsen, Franck van Breugel

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2019.9

zbMATH Keywords

behavioural metricsprobabilistic automatasimple policy iteration algorithmsimple stochastic games

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Computing probabilistic bisimilarity distances for probabilistic automata
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• Computing probabilistic bisimilarity distances via policy iteration

Cites work

• (Metric) bisimulation games and real-valued modal logics for coalgebras
• A strongly polynomial algorithm for the transportation problem
• Computational optimal transport. With applications to data sciences
• Computing Game Metrics on Markov Decision Processes
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computing probabilistic bisimilarity distances via policy iteration
• Deciding probabilistic bisimilarity distance one for labelled Markov chains
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Formal verification of timed properties of randomized distributed algorithms
• Gromov-Wasserstein distances and the metric approach to object matching
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 195106 (Why is no real title available?)
• scientific article; zbMATH DE number 7204557 (Why is no real title available?)
• On the equivalence of game and denotational semantics for the probabilistic -calculus
• On the simplex algorithm for networks and generalized networks
• Stochastic Games
• Stochastic Games with Perfect Information and Time Average Payoff
• The complexity of computing a bisimilarity pseudometric on probabilistic automata

Cited in

(8)

• Deciding probabilistic bisimilarity distance one for probabilistic automata
• scientific article; zbMATH DE number 6987095 (Why is no real title available?)
• scientific article; zbMATH DE number 7318983 (Why is no real title available?)
• Monads and Quantitative Equational Theories for Nondeterminism and Probability
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Fixpoint Theory -- Upside Down
• Computing bisimilarity metrics for probabilistic timed automata
• Quantifying masking fault-tolerance via fair stochastic games

This page was built for publication: Computing probabilistic bisimilarity distances for probabilistic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875370)