On the connections between PCTL and dynamic programming
From MaRDI portal
Publication:2985889
DOI10.1145/1755952.1755988zbMath1361.68150arXiv0910.4738OpenAlexW2135245897MaRDI QIDQ2985889
Debasish Chatterjee, Sean Summers, John Lygeros, Federico Alessandro Ramponi
Publication date: 10 May 2017
Published in: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.4738
Computational methods in Markov chains (60J22) Dynamic programming (90C39) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (7)
Stochastic system controller synthesis for reachability specifications encoded by random sets ⋮ Characterization and computation of infinite-horizon specifications over Markov processes ⋮ Control synthesis for stochastic systems given automata specifications defined by stochastic sets ⋮ Dynamic Bayesian networks for formal verification of structured stochastic processes ⋮ Maximizing the probability of attaining a target prior to extinction ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey ⋮ Robustly complete finite-state abstractions for verification of stochastic systems
Cites Work
- Unnamed Item
- Unnamed Item
- What's decidable about hybrid automata?
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Discrete-time control for rectangular hybrid automata
- Unfoldings: A partial-order approach to model checking.
- Marked directed graphs
- Stability Analysis of Networked Control Systems Using a Switched Linear Systems Approach
- Decentralized Control of Discrete-Event Systems With Bounded or Unbounded Delay Communication
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
This page was built for publication: On the connections between PCTL and dynamic programming
