Approximating Markov processes by averaging
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 42272 (Why is no real title available?)
- scientific article; zbMATH DE number 3464348 (Why is no real title available?)
- scientific article; zbMATH DE number 1956514 (Why is no real title available?)
- scientific article; zbMATH DE number 2038770 (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 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3228674 (Why is no real title available?)
- scientific article; zbMATH DE number 3088534 (Why is no real title available?)
- A hierarchy of probabilistic system types
- A probabilistic PDL
- Algebraic laws for nondeterminism and concurrency
- Approximating labelled Markov processes
- Approximation theorems for Markov operators
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Bisimulation from open maps
- Bisimulation through probabilistic testing
- Conditional expectation and the approximation of labelled Markov processes.
- Continuous Capacities on Continuous State Spaces
- Continuous Previsions
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computational Structures
- Introdction to Measure and Probability
- Inverse Limits of Measure Spaces
- Labelled Markov processes.
- Metrics for labelled Markov processes
- One-parameter semigroups of positive operators
- Operator-theoretical treatment of Markoff's process and mean ergodic theorem
- Prevision Domains and Convex Powercones
- Probability with Martingales
- Semi-pullbacks and bisimulation in categories of Markov processes
- Simulation Hemi-metrics between Infinite-State Stochastic Games
- Stochastic Relations
- Stochastic coalgebraic logic
- Testing Semantics: Connecting Processes and Process Logics
Cited in
(25)- Pointless learning
- Approximating bisimilarity for Markov processes
- Dirichlet is natural
- Averaging for a Fully Coupled Piecewise-Deterministic Markov Process in Infinite Dimensions
- Approximating Markov processes through filtration
- A categorical characterization of relative entropy on standard Borel spaces
- A metrized duality theorem for Markov processes
- Analysis of averages over distributions of Markov processes
- scientific article; zbMATH DE number 7199585 (Why is no real title available?)
- Approximating Markov Processes by Averaging
- Bisimulation for Feller-Dynkin processes
- Approximating labelled Markov processes
- scientific article; zbMATH DE number 1956514 (Why is no real title available?)
- Borel kernels and their approximation, categorically
- Giry and the Machine
- Approximating labelled Markov processes again!
- Conditional expectation and the approximation of labelled Markov processes.
- Labelled Markov processes.
- Taking it to the limit: approximate reasoning for Markov processes
- Moment semantics for reversible rule-based systems
- An algebraic theory of Markov processes
- A categorical characterization of relative entropy on standard Borel spaces
- On the metric-based approximate minimization of Markov chains
- Labelled Markov processes: stronger and faster approximations
- Averaging along a Markov chain
This page was built for publication: Approximating Markov processes by averaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895176)
