Approximating Markov processes through filtration
DOI10.1016/J.TCS.2012.03.026zbMATH Open1257.68111OpenAlexW2079922371MaRDI QIDQ442296FDOQ442296
Authors: Chunlai Zhou, Mingsheng Ying 
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.026
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Modal logic
- Title not available (Why is that?)
- Stochastic coalgebraic logic
- Approximating labelled Markov processes
- Universal coalgebra: A theory of systems
- Bisimulation and cocongruence for probabilistic systems
- Approximating and computing behavioural distances in probabilistic transition systems
- Bisimulation for labelled Markov processes
- Title not available (Why is that?)
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
- Approximating Markov Processes by Averaging
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Metrics for labelled Markov processes
- Probabilistic systems coalgebraically: a survey
- A probabilistic PDL
- Interactive epistemology. II: Probability
- Exemplaric Expressivity of Modal Logics
- Deduction systems for coalgebras over measurable spaces
- Probability logic for type spaces
- A behavioural pseudometric for probabilistic transition systems
- Recursively defined metric spaces without contraction
- Title not available (Why is that?)
- \(\pi\)-calculus with noisy channels
- Game Refinement Relations and Metrics
- Title not available (Why is that?)
- Topology-free typology of beliefs
- Coalgebraic logic over general measurable spaces -- a survey
- Probability logic of finitely additive beliefs
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
- Final coalgebras for functors on measurable spaces
- Labelled Markov processes: stronger and faster approximations
- A complete deductive system for probability logic
- Topological Completeness in an Ideal Model for Polymorphic Types
- Semi-pullbacks for stochastic relations over analytic spaces
- Model-checking continuous-time Markov chains
Cited In (10)
- Level-wise approximation of a Markov process associated to the boundary of an infinite tree
- A filtering technique for Markov chains with applications to spectral embedding
- Approximating bisimilarity for Markov processes
- 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
- Title not available (Why is that?)
- 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)
