Publication:5856412
From MaRDI portal
Giovanni Bacci, Giorgio Bacci, Radu Mardare, Qiyi Tang, Kim Guldstrand Larsen, Franck Van Breugel
Publication date: 26 March 2021
Full work available at URL: https://arxiv.org/abs/1907.01768
Related Items
Cites Work
- On behavioural pseudometrics and closure ordinals
- Metrics for labelled Markov processes
- On metrics for probabilistic systems: definitions and algorithms
- The complexity of stochastic games
- The complexity of mean payoff games on graphs
- On the metric-based approximate minimization of Markov chains
- A strongly polynomial algorithm for the transportation problem
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Algorithms for Game Metrics
- On the equivalence of game and denotational semantics for the probabilistic mu-calculus
- On the Complexity of Computing Probabilistic Bisimilarity
- Computing Game Metrics on Markov Decision Processes
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- On the simplex algorithm for networks and generalized networks
- Converging from branching to linear metrics on Markov chains
- On-the-Fly Exact Computation of Bisimilarity Distances
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
