Bisimulation through probabilistic testing
Information and Computation
Numerical methods for stochastic control problems in continuous time
Numerical methods for stochastic control problems in continuous time
Theoretical Computer Science
Lyapunov-Like Techniques for Stochastic Stability
SIAM Journal on Control and Optimization
On contraction analysis for non-linear systems
Automatica (Journal of IFAC)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Labelled Markov Processes: Stronger and Faster Approximations
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Uncertain convex programs: randomized solutions and confidence levels
Mathematical Programming: Series A and B
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Approximately bisimilar symbolic models for nonlinear control systems
Automatica (Journal of IFAC)
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
Comparative branching-time semantics for Markov chains
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Bisimulation for general stochastic hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Bisimulation for communicating piecewise deterministic markov processes (CPDPs)
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Correctness issues of symbolic bisimulation computation for markov chains
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
This article provides a survey of approximation metrics for stochastic processes. We deal with Markovian processes in discrete time evolving on general state spaces, namely on domains with infinite cardinality and endowed with proper measurability and metric structures. The focus of this work is to discuss approximation metrics between two such processes, based on the notion of probabilistic bisimulation: in particular we investigate metrics characterized by an approximate variant of this notion. We suggest that metrics between two processes can be introduced essentially in two distinct ways: the first employs the probabilistic conditional kernels underlying the two stochastic processes under study, and leverages notions derived from algebra, logic, or category theory; whereas the second looks at distances between trajectories of the two processes, and is based on the dynamical properties of the two processes (either their syntax, via the notion of bisimulation function; or their semantics, via sampling techniques). The survey moreover covers the problem of constructing formal approximations of stochastic processes according to the introduced metrics.