Labelled Markov Processes: Stronger and Faster Approximations
Explore this paper's citation graph
Summary
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year and are improvements over former constructions in the sense that they capture more properties than before and that converge faster to the approximated process.
- Type
- article
- Published
- 2004-11-01
- Cited by
- 27
- References
- 23
- Access
- Open access
- OpenAlex
- https://openalex.org/W2164875685
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:7526226
Keywords
Markov chain, Approximations of π, Markov process, Computer science, Markov model
References
- Approximating Continuous Markov Processes
- Domain of Computation of a Random Field in Statistical Physics
- Probability with Martingales
- Labeled Markov processes: stronger and faster approximations
- The Expressive Power of Indeterminate Dataflow Primitives
- Algebraic laws for nondeterminism and concurrency
- A Calculus of Mobile Processes, II
- Theory of capacities
- Approximating labelled Markov processes
- An Invitation To C*-Algebras
- Domain theory and integration
- Approximating labeled Markov processes
- A probabilistic powerdomain of evaluations
- Bisimulation for labelled Markov processes
- Bisimulation for Labelled Markov Processes
- Probability with Martingales
- Metrics for Labeled Markov Systems
- Semi-pullbacks and Bisimulations in Categories of Stochastic Relations
- Testing Labelled Markov Processes
- The Measurement Process in Domain Theory
Cited by
- Analyse de diverses distances en vérification formelle probabiliste
- Évaluation symbolique de systèmes probabilistes à espace d'états continu
- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
- On finite-state approximants for probabilistic computation tree logic
- Approximating Markov processes through filtration
- A logical duality for underspecified probabilistic systems
- Least upper bounds for probability measures and their applications to abstractions
- Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey
- An approximation algorithm for labelled Markov processes: towards realistic approximation
- Domains of Commutative C-Subalgebras
- A METHODOLOGY FOR THE STOCHASTIC MODELLING AND SIMULATION OF SYMPATRIC SPECIATION BY SEXUAL SELECTION
- ProNoBiS - Probability and Nondeterminism, Bisimulations and Security
- Probabilistic bisimulation
- Dcpos of Commutative C*-subalgebras
- Stochastic systems divergence through reinforcement learning
- Distribution-Based Bisimulation for Labelled Markov Processes
- Almost Sure Bisimulation in Labelled Markov Processes
- Concurrency, sigma-Algebras, and Probabilistic Fairness
- A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems
- Finite Approximation of LMPs for Exact Verification of Reachability Properties
Related papers
- The Strong Law of Large Numbers for Markov Chains in Markovian Environments
- Decomposition and aggregation of large-dimensional Markov chains in discrete time
- BDSDEs with Markov Chains and applications in Markovian-Switching LQ problems for backward doubly stochastic system
- SAFETY ASSESSMENT FOR SAFETY-CRITICAL SYSTEMS USING MARKOV CHAIN MODULAR APPROACH
- Application of Markov Chains to Analyze and Predict the Time Series
- TOP-N selective Markov prediction model
- Impact the Temperature of Bangladesh: An Application of Markov Model
- Comparison of Three Web Search Algorithms
- Markov and Non-Markov Models for Brand Switching and Market Share Forecasting