Publication:5111641
From MaRDI portal
DOI10.4230/LIPIcs.CONCUR.2017.27zbMath1442.68152MaRDI QIDQ5111641
Publication date: 27 May 2020
60J22: Computational methods in Markov chains
68W40: Analysis of algorithms
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
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
- 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
- Unnamed Item