Approximating Markov processes through filtration

DOI10.1016/J.TCS.2012.03.026zbMath1257.68111OpenAlexW2079922371MaRDI QIDQ442296

Chunlai Zhou, Ming Sheng 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

zbMATH Keywords

filtrationprobability logicmetric approximationbisimilaritycoalgebra, Kripke modelsMarkov transition systems

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Probability and inductive logic (03B48) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Approximating bisimilarity for Markov processes ⋮ A modal characterization of alternating approximate bisimilarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Probabilistic systems coalgebraically: a survey
• Stochastic coalgebraic logic
• A probabilistic PDL
• Topology-free typology of beliefs
• Approximating labelled Markov processes
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Universal coalgebra: A theory of systems
• A behavioural pseudometric for probabilistic transition systems
• Interactive epistemology. II: Probability
• Probability logic of finitely additive beliefs
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
• Recursively defined metric spaces without contraction
• Bisimulation and cocongruence for probabilistic systems
• Final coalgebras for functors on measurable spaces
• Approximating and computing behavioural distances in probabilistic transition systems
• Bisimulation for labelled Markov processes
• \(\pi\)-calculus with noisy channels
• Coalgebraic logic over general measurable spaces – a survey
• Exemplaric Expressivity of Modal Logics
• Deduction Systems for Coalgebras Over Measurable Spaces
• Game Refinement Relations and Metrics
• A Complete Deductive System for Probability Logic
• Algebraic laws for nondeterminism and concurrency
• Topological Completeness in an Ideal Model for Polymorphic Types
• Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
• Semi-pullbacks for stochastic relations over analytic spaces
• Model-checking continuous-time Markov chains
• Approximating Markov Processes by Averaging
• Probability logic for type spaces

This page was built for publication: Approximating Markov processes through filtration