Runtime monitors for Markov decision processes
From MaRDI portal
Publication:832291
DOI10.1007/978-3-030-81688-9_26zbMath1493.68214arXiv2105.12322OpenAlexW3184761245MaRDI QIDQ832291
Hazem Torfah, Sanjit A. Seshia, Sebastian Junges
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2105.12322
Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal cost almost-sure reachability in POMDPs
- Model-based testing of probabilistic systems
- Verification and control of partially observable probabilistic systems
- An overview of the runtime verification tool Java PathExplorer
- Probabilistic black-box reachability checking (extended version)
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Optimistic value iteration
- A tale of two diagnoses in probabilistic systems
- Relationships between nondeterministic and deterministic tape complexities
- Interval iteration algorithm for MDPs and IMDPs
- Permissive Controller Synthesis for Probabilistic Systems
- The Complexity of Markov Decision Processes
- The quickhull algorithm for convex hulls
- Algorithmic analysis of nonlinear hybrid systems
- Distinguishing Hidden Markov Chains
- Partial-Observation Stochastic Games
- Shield Synthesis:
- Active Diagnosis for Probabilistic Systems
- Monitoring Temporal Properties of Stochastic Systems
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Formal Modeling and Analysis of Timed Systems
- Run-time optimization for learned controllers through quantitative games
This page was built for publication: Runtime monitors for Markov decision processes
