An algorithm for quantitive verification of probabilistic transition systems
From MaRDI portal
Recommendations
- Approximating and computing behavioural distances in probabilistic transition systems
- Towards quantitative verification of probabilistic transition systems
- A behavioural pseudometric for probabilistic transition systems
- On metrics for probabilistic systems: definitions and algorithms
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
Cited in
(36)- Polynomial-time algorithms for computing distances of fuzzy transition systems
- A behavioural pseudometric for probabilistic transition systems
- Probabilistic divide \& congruence: branching bisimilarity
- How adaptive and reliable is your program?
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Recursively defined metric spaces without contraction
- Bisimulation and cocongruence for probabilistic systems
- Approximating and computing behavioural distances in probabilistic transition systems
- A metrized duality theorem for Markov processes
- Proving approximate implementations for probabilistic I/O automata
- Generalized quantitative analysis of metric transition systems
- A pseudometric in supervisory control of probabilistic discrete event systems
- Towards quantitative verification of probabilistic transition systems
- On behavioural pseudometrics and closure ordinals
- SOS-based modal decomposition on nondeterministic probabilistic processes
- Bisimulations for probabilistic and quantum processes (invited paper)
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Bisimulation for Markov decision processes through families of functional expressions
- Non Expansive ε-Bisimulations
- Measuring the confinement of probabilistic systems
- A probabilistic algorithm to test local algebraic observability in polynomial time
- Approximating Markov processes by averaging
- Metrics for labelled Markov processes
- Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers
- Structure in machine learning
- Metrics for action-labelled quantitative transition systems
- The Kantorovich metric in computer science: a brief survey
- Logical characterization of bisimulation metrics
- Universal quantitative algebra for fuzzy relations and generalised metric spaces
- Quantitative analysis of weighted transition systems
- Expressivity of bisimulation pseudometrics over analytic state spaces
- Quantitative monoidal algebra: axiomatising distance with string diagrams
- Using probabilistic Kleene algebra pKA for protocol verification
- On metrics for probabilistic systems: definitions and algorithms
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
This page was built for publication: An algorithm for quantitive verification of probabilistic transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791270)
