scientific article; zbMATH DE number 7649917

DOI10.4230/LIPIcs.CONCUR.2019.9MaRDI QIDQ5875370

Giorgio Bacci, Radu Mardare, Giovanni Bacci, Qiyi Tang, Franck Van Breugel, Kim Guldstrand Larsen

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probabilistic automatasimple stochastic gamesbehavioural metricssimple policy iteration algorithm

Mathematics Subject Classification ID

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

Related Items (4)

Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Fixpoint Theory -- Upside Down ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability

Cites Work

• Computational Optimal Transport: With Applications to Data Science
• Gromov-Wasserstein distances and the metric approach to object matching
• A strongly polynomial algorithm for the transportation problem
• On the equivalence of game and denotational semantics for the probabilistic mu-calculus
• Computing Game Metrics on Markov Decision Processes
• On the simplex algorithm for networks and generalized networks
• Computing Probabilistic Bisimilarity Distances via Policy Iteration
• (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
• Formal verification of timed properties of randomized distributed algorithms
• The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
• Stochastic Games with Perfect Information and Time Average Payoff
• Stochastic Games
• Deciding probabilistic bisimilarity distance one for labelled Markov chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: