Taking it to the limit: approximate reasoning for Markov processes
From MaRDI portal
Markov processes (60J99) 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) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Recommendations
Cited in
(15)- SOS specifications for uniformly continuous operators
- Compositionality for quantitative specifications
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- An effective Markov based approach for calculating the limit matrix in the analytic network process
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Probabilistic NetKAT
- A metrized duality theorem for Markov processes
- scientific article; zbMATH DE number 4133292 (Why is no real title available?)
- Approximate reasoning for real-time probabilistic processes
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
- Logical characterization of trace metrics
- Language-based abstractions for dynamical systems
- Logical characterization of bisimulation metrics
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
This page was built for publication: Taking it to the limit: approximate reasoning for Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912766)