Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
From MaRDI portal
Recommendations
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Behavioural pseudometrics for nondeterministic probabilistic systems
- A behavioural pseudometric for probabilistic transition systems
- Approximating and computing behavioural distances in probabilistic transition systems
- A pseudometric in supervisory control of probabilistic discrete event systems
- On metrics for probabilistic systems: definitions and algorithms
- Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- CONCUR 2005 – Concurrency Theory
Cited in
(10)- Behavioural pseudometrics for nondeterministic probabilistic systems
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Approximating and computing behavioural distances in probabilistic transition systems
- A pseudometric in supervisory control of probabilistic discrete event systems
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- A behavioural pseudometric based on -bisimilarity
- Bisimulation for Markov decision processes through families of functional expressions
- Asymmetric Distances for Approximate Differential Privacy
- The Kantorovich metric in computer science: a brief survey
- On metrics for probabilistic systems: definitions and algorithms
This page was built for publication: Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758050)