Towards quantitative verification of probabilistic transition systems
From MaRDI portal
Recommendations
Cited in
(68)- Characterize branching distance in terms of ( , )-bisimilarity
- Approximating labelled Markov processes
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Behavioural pseudometrics for nondeterministic probabilistic systems
- SOS specifications for uniformly continuous operators
- A behavioural pseudometric for probabilistic transition systems
- On the metric-based approximate minimization of Markov chains
- Bisimulation metrics and norms for real-weighted automata
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Complete axiomatization for the total variation distance of Markov chains
- A unified framework for differential aggregations in Markovian process algebra
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Specification, testing and implementation relations for symbolic-probabilistic systems
- Bisimulation and cocongruence for probabilistic systems
- Approximating and computing behavioural distances in probabilistic transition systems
- \(\pi\)-calculus with noisy channels
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- A metrized duality theorem for Markov processes
- Equivalences for silent transitions in probabilistic systems (extended abstract)
- Proving approximate implementations for probabilistic I/O automata
- Probabilistic Automata for Safety LTL Specifications
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Symbolic model checking in non-Boolean domains
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- scientific article; zbMATH DE number 1864592 (Why is no real title available?)
- scientific article; zbMATH DE number 1884411 (Why is no real title available?)
- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Up-to techniques for behavioural metrics via fibrations
- scientific article; zbMATH DE number 7455747 (Why is no real title available?)
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- Differential logical relations. I: The simply-typed case
- Characteristic logics for behavioural hemimetrics via fuzzy lax extensions
- Distances between states and between predicates
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- Model Checking Quantitative Linear Time Logic
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Bisimulation for Markov decision processes through families of functional expressions
- Simulation Hemi-metrics between Infinite-State Stochastic Games
- Non Expansive ε-Bisimulations
- Measuring the confinement of probabilistic systems
- Automata, Languages and Programming
- Approximating Markov processes by averaging
- Metrics for labelled Markov processes
- Weak bisimulation for probabilistic timed automata
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
- Bounded Verification of Reachability of Probabilistic Hybrid Systems
- Convex lattice equation systems
- Up-to techniques for behavioural metrics via fibrations
- Structure in machine learning
- A partial metric semantics of higher-order types and approximate program transformations
- Minimising the probabilistic bisimilarity distance
- A complete quantitative axiomatisation of behavioural distance of regular expressions
- Quantitative verification with neural networks
- Metrics for action-labelled quantitative transition systems
- The Kantorovich metric in computer science: a brief survey
- Logical characterization of trace metrics
- Extended differential aggregations in process algebra for performance and biology
- Universal quantitative algebra for fuzzy relations and generalised metric spaces
- Quantitative verification with neural networks
- Expressivity of bisimulation pseudometrics over analytic state spaces
- Quantitative monoidal algebra: axiomatising distance with string diagrams
- Complete FSM testing using strong separability
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
This page was built for publication: Towards quantitative verification of probabilistic transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535035)
