Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Stochastic Optimal Control: The Discrete-Time Case
Stochastic Optimal Control: The Discrete-Time Case
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
Control Techniques for Complex Networks
Control Techniques for Complex Networks
Verification and Control of Hybrid Systems: A Symbolic Approach
Verification and Control of Hybrid Systems: A Symbolic Approach
On the connections between PCTL and dynamic programming
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Three-valued abstractions of Markov chains: completeness for a sizeable fragment of PCTL
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem
Automatica (Journal of IFAC)
Quantitative automata model checking of autonomous stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Regularization of bellman equations for infinite-horizon probabilistic properties
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
| Hi-index | 5.23 |
This work is devoted to the formal verification of specifications over general discrete-time Markov processes, with an emphasis on infinite-horizon properties. These properties, formulated in a modal logic known as PCTL, can be expressed through value functions defined over the state space of the process. The main goal is to understand how structural features of the model (primarily the presence of absorbing sets) influence the uniqueness of the solutions of corresponding Bellman equations. Furthermore, this contribution shows that the investigation of these structural features leads to new computational techniques to calculate the specifications of interest: the emphasis is to derive approximation techniques with associated explicit convergence rates and formal error bounds.