Approximating Markov processes through filtration
From MaRDI portal
(Redirected from Publication:442296)
filtrationmetric approximationprobability logicbisimilaritycoalgebra, Kripke modelsMarkov transition systems
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Probability and inductive logic (03B48) Discrete-time Markov processes on general state spaces (60J05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 1696897 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 49833 (Why is no real title available?)
- scientific article; zbMATH DE number 1113628 (Why is no real title available?)
- scientific article; zbMATH DE number 1489632 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- A behavioural pseudometric for probabilistic transition systems
- A complete deductive system for probability logic
- A probabilistic PDL
- Algebraic laws for nondeterminism and concurrency
- Approximating Markov Processes by Averaging
- Approximating and computing behavioural distances in probabilistic transition systems
- Approximating labelled Markov processes
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Coalgebraic logic over general measurable spaces -- a survey
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Deduction systems for coalgebras over measurable spaces
- Exemplaric Expressivity of Modal Logics
- Final coalgebras for functors on measurable spaces
- Game Refinement Relations and Metrics
- Interactive epistemology. II: Probability
- Labelled Markov processes: stronger and faster approximations
- Metrics for labelled Markov processes
- Modal logic
- Model-checking continuous-time Markov chains
- Probabilistic systems coalgebraically: a survey
- Probability logic for type spaces
- Probability logic of finitely additive beliefs
- Recursively defined metric spaces without contraction
- Semi-pullbacks for stochastic relations over analytic spaces
- Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
- Stochastic coalgebraic logic
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
- Topological Completeness in an Ideal Model for Polymorphic Types
- Topology-free typology of beliefs
- Universal coalgebra: A theory of systems
- \(\pi\)-calculus with noisy channels
Cited in
(10)- A filtering technique for Markov chains with applications to spectral embedding
- Approximating bisimilarity for Markov processes
- Level-wise approximation of a Markov process associated to the boundary of an infinite tree
- A Monte Carlo Approach to Filtering for a Class of Marked Doubly Stochastic Poisson Processes
- Approximating Markov Processes by Averaging
- Relative entropy and error bounds for filtering of Markov processes
- scientific article; zbMATH DE number 4052846 (Why is no real title available?)
- A modal characterization of alternating approximate bisimilarity
- Filtration of components of processes of random evolution
- Filters, mollifiers and the computation of the Gibbs phenomenon
This page was built for publication: Approximating Markov processes through filtration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442296)
