Complete axiomatization for the total variation distance of Markov chains
From MaRDI portal
Publication:2130580
DOI10.1016/j.entcs.2018.03.014OpenAlexW2802472755WikidataQ113317566 ScholiaQ113317566MaRDI QIDQ2130580
Giovanni Bacci, Giorgio Bacci, Radu Mardare, Kim Guldstrand Larsen
Publication date: 25 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2018.03.014
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Convex lattice equation systems ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative Kleene coalgebras
- Metrics for labelled Markov processes
- Axiomatizations for probabilistic finite-state behaviors
- A complete inference system for a class of regular behaviours
- Approximating and computing behavioural distances in probabilistic transition systems
- Postulates for the barycentric calculus
- Converging from Branching to Linear Metrics on Markov Chains
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- On the Total Variation Distance of Semi-Markov Chains
- Equational Axioms for Probabilistic Bisimilarity
- Deriving Syntax and Axioms for Quantitative Regular Behaviours
- Quantitative Algebraic Reasoning
- Semantics for Algebraic Operations
- Two Complete Axiom Systems for the Algebra of Regular Events
- Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
- A complete axiomatisation for trace congruence of finite state behaviors