scientific article; zbMATH DE number 7204944

DOI10.4230/LIPIcs.CONCUR.2017.27zbMath1442.68152MaRDI QIDQ5111641

Qiyi Tang, Franck Van Breugel

Publication date: 27 May 2020

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

zbMATH Keywords

policy iterationpseudometricprobabilistic bisimilaritylabelled Markov chain

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Analysis of algorithms (68W40) 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

Sound approximate and asymptotic probabilistic bisimulations for PCTL, On the metric-based approximate minimization of Markov chains

Cites Work

• A calculus of communicating systems
• Bisimulation through probabilistic testing
• The complexity of stochastic games
• A polynomial time primal network simplex algorithm for minimum cost flows
• A lattice-theoretical fixpoint theorem and its applications
• On the Complexity of Computing Probabilistic Bisimilarity
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Computing Probabilistic Bisimilarity Distances via Policy Iteration
• On-the-Fly Exact Computation of Bisimilarity Distances
• The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
• On Nonterminating Stochastic Games
• The Distribution of a Product from Several Sources to Numerous Localities
• Stochastic Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item