Metrics for labelled Markov processes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1361128
- Approximating labelled Markov processes
- Labelled Markov processes: stronger and faster approximations
- scientific article; zbMATH DE number 2086650
- Labelled Markov processes.
- On the total variation distance of labelled Markov chains
- scientific article; zbMATH DE number 446474
- A BIC-based consistent metric between Markovian processes
- Approximating labelled Markov processes again!
- Labelled Markov processes as generalised stochastic relations
Cites work
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3964277 (Why is no real title available?)
- scientific article; zbMATH DE number 4064931 (Why is no real title available?)
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1231682 (Why is no real title available?)
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- scientific article; zbMATH DE number 1113628 (Why is no real title available?)
- scientific article; zbMATH DE number 1956514 (Why is no real title available?)
- scientific article; zbMATH DE number 1754609 (Why is no real title available?)
- scientific article; zbMATH DE number 1864592 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- scientific article; zbMATH DE number 4185071 (Why is no real title available?)
- A Compositional Approach to Performance Modelling
- A probabilistic PDL
- Approximating labelled Markov processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Bisimulation for labelled Markov processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation through probabilistic testing
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Composition and behaviors of probabilistic I/O automata
- Model checking of probabilistic and nondeterministic systems
- Probabilistic propositional temporal logics
- Reactive, generative, and stratified models of probabilistic processes
- Receptive process theory
- Stochastic modelling of flexible manufacturing systems
- Symbolic model checking for probabilistic processes
- Testing preorders for probabilistic processes
- The complexity of probabilistic verification
Cited in
(only showing first 100 items - show all)- Converging from branching to linear metrics on Markov chains
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- A framework to measure the robustness of programs in the unpredictable environment
- Asymmetric Distances for Approximate Differential Privacy
- Quantitative relations and approximate process equivalences.
- scientific article; zbMATH DE number 7447772 (Why is no real title available?)
- Approximate bisimulation relations for constrained linear systems
- scientific article; zbMATH DE number 2086650 (Why is no real title available?)
- Equational reasonings in wireless network gossip protocols
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- Proving approximate implementations for probabilistic I/O automata
- Weighted modal transition systems
- Probabilistic NetKAT
- Approximating Markovian testing equivalence
- Denotational semantics and its algebraic derivation for an event-driven system-level language
- Approximating Markov processes through filtration
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- A metrized duality theorem for Markov processes
- A probabilistic calculus of cyber-physical systems
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Random Measurable Selections
- Bisimulation for Feller-Dynkin processes
- Approximating labelled Markov processes again!
- Compositional weak metrics for group key update
- Probabilistic divide \& congruence: branching bisimilarity
- A pseudometric in supervisory control of probabilistic discrete event systems
- SOS specifications for uniformly continuous operators
- Approximate simulation relations for hybrid systems
- A UTP approach for rTiMo
- Approximate bisimulation: a bridge between computer science and control theory
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Compositionality for quantitative specifications
- Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity
- Fixed-point characterization of compositionality properties of probabilistic processes combinators
- Testing probabilistic equivalence through reinforcement learning
- The category-theoretic solution of recursive metric-space equations
- Parametric probabilistic transition systems for system design and analysis
- Weak bisimulation for probabilistic timed automata
- SOS-based modal decomposition on nondeterministic probabilistic processes
- Simulation distances
- Characterization and computation of infinite-horizon specifications over Markov processes
- Metrics for weighted transition systems: axiomatization and complexity
- Weak simulation quasimetric in a gossip scenario
- On metrics for probabilistic systems: definitions and algorithms
- Recursively defined metric spaces without contraction
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Non Expansive ε-Bisimulations
- Automated verification and synthesis of stochastic hybrid systems: a survey
- Bisimulation and cocongruence for probabilistic systems
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Three metric domains of processes for bisimulation
- Differential privacy in probabilistic systems
- Some properties of stochastic labeling procedures
- Approximating and computing behavioural distances in probabilistic transition systems
- Domain theory, testing and simulation for labelled Markov processes
- On the metric-based approximate minimization of Markov chains
- Interleaving isotactics -- an equivalence notion on behaviour abstractions
- Lattice-valued simulations for quantitative transition systems
- Interface simulation distances
- A modal characterization of alternating approximate bisimilarity
- Value-passing CCS with noisy channels
- Approximating Markov processes by averaging
- A quantified coalgebraic van Benthem theorem
- Back to the format: a survey on SOS for probabilistic processes
- Limited approximate bisimulations and the corresponding rough approximations
- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations
- (Towards a) statistical probabilistic lazy lambda calculus
- Structure in machine learning
- How adaptive and reliable is your program?
- Differential logical relations. II: Increments and derivatives
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Bisimulation for Markov decision processes through families of functional expressions
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Logical foundations of quantitative equality
- Convex lattice equation systems
- Hennessy-Milner results for probabilistic PDL
- Borel kernels and their approximation, categorically
- A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
- Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach
- scientific article; zbMATH DE number 7199585 (Why is no real title available?)
- On computing the total variation distance of hidden Markov models
- Computing probabilistic bisimilarity distances for probabilistic automata
- A monoidal view on fixpoint checks
- Computing bisimilarity metrics for probabilistic timed automata
- Quantitative simulation games
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Computing branching distances with quantitative games
- Simulation Hemi-metrics between Infinite-State Stochastic Games
- Differential logical relations. I: The simply-typed case
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- Complete axiomatization for the total variation distance of Markov chains
- scientific article; zbMATH DE number 7566075 (Why is no real title available?)
- scientific article; zbMATH DE number 7559483 (Why is no real title available?)
- Bisimulation metrics and norms for real-weighted automata
- Dynamics of reputation in mobile agents systems and weighted timed automata
- Drawing from an urn is isometric
- (Metric) bisimulation games and real-valued modal logics for coalgebras
This page was built for publication: Metrics for labelled Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596029)
