Viability theory
Neuro-Dynamic Programming
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
DISCRETE TIME RISK MODELS UNDER RATES OF INTEREST
Probability in the Engineering and Informational Sciences
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)
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Probability Theory with Applications (Mathematics and Its Applications)
Probability Theory with Applications (Mathematics and Its Applications)
Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
Probabilistic model checking of complex biological pathways
Theoretical Computer Science
Using probabilistic model checking in systems biology
ACM SIGMETRICS Performance Evaluation Review
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats
COMPSAC '08 Proceedings of the 2008 32nd Annual IEEE International Computer Software and Applications Conference
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
Formal Support for Quantitative Analysis of Residual Risks in Safety-Critical Systems
HASE '08 Proceedings of the 2008 11th IEEE High Assurance Systems Engineering Symposium
Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Reachability questions in piecewise deterministic Markov processes
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Reachability analysis for controlled discrete time stochastic hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
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
On reachability and minimum cost optimal control
Automatica (Journal of IFAC)
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Quantitative automata model checking of autonomous stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
A stochastic reach-avoid problem with random obstacles
Proceedings of the 14th international conference on Hybrid systems: computation and control
Regularization of bellman equations for infinite-horizon probabilistic properties
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Higher-Order approximations for verification of stochastic hybrid systems
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Control design for specifications on stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Stochastic system controller synthesis for reachability specifications encoded by random sets
Automatica (Journal of IFAC)
Characterization and computation of infinite-horizon specifications over Markov processes
Theoretical Computer Science
| Hi-index | 0.00 |
Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking. In this paper, we consider PCTL for noncountable-space Markov chains, and we show that there is a substantial affinity between certain of its operators and problems of Dynamic Programming. We prove some basic properties of the solutions to the latter. We also provide two examples and demonstrate how recovery strategies in practical applications, which are naturally stated as reach-avoid problems, can be viewed as particular cases of PCTL formulas.