Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
From MaRDI portal
Recommendations
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
- On metrics for probabilistic systems: definitions and algorithms
- Approximating and computing behavioural distances in probabilistic transition systems
- A behavioural pseudometric for probabilistic transition systems
- Behavioural pseudometrics for nondeterministic probabilistic systems
Cited in
(16)- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Approximating and computing behavioural distances in probabilistic transition systems
- A pseudometric in supervisory control of probabilistic discrete event systems
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- On behavioural pseudometrics and closure ordinals
- scientific article; zbMATH DE number 1864592 (Why is no real title available?)
- A modal characterization of alternating approximate bisimilarity
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- A behavioural pseudometric based on -bisimilarity
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
- Computing probabilistic bisimilarity distances for probabilistic automata
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- Computing bisimilarity metrics for probabilistic timed automata
- On metrics for probabilistic systems: definitions and algorithms
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
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 Q3518278)
