Converging from branching to linear metrics on Markov chains
From MaRDI portal
Publication:4559599
DOI10.1017/S0960129517000160zbMath1407.68278OpenAlexW2737406852MaRDI QIDQ4559599
Giovanni Bacci, Giorgio Bacci, Radu Mardare, Kim Guldstrand Larsen
Publication date: 4 December 2018
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129517000160
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- Bisimulation through probabilistic testing
- The consensus string problem and the complexity of comparing hidden Markov models.
- Deciding bisimilarity and similarity for probabilistic processes.
- On the Complexity of Computing Probabilistic Bisimilarity
- On the Total Variation Distance of Semi-Markov Chains
- Computing Game Metrics on Markov Decision Processes
- Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
- Three Partition Refinement Algorithms
- A simple coupling of renewal processes
- On the total variation distance of labelled Markov chains
- On-the-Fly Exact Computation of Bisimilarity Distances
- Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
- Bisimulation for Markov Decision Processes through Families of Functional Expressions
- Automata, Languages and Programming
This page was built for publication: Converging from branching to linear metrics on Markov chains
