MDPs as distribution transformers: Affine invariant synthesis for safety objectives
Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve i...
Saved in:
Main Authors: | AKSHAY, S., CHATTERJEE, Krishnendu, MEGGENDORFER, Tobias, ZIKELIC, Dorde |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9068 https://ink.library.smu.edu.sg/context/sis_research/article/10071/viewcontent/Computer_Aided_Verification.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties
by: AKSHAY, S., et al.
Published: (2024) -
Algorithms and hardness results for computing cores of Markov chains
by: AHMADI, Ali, et al.
Published: (2020) -
Flip-invariant SIFT for copy and object detection
by: ZHAO, Wan-Lei, et al.
Published: (2013) -
Solving long-run average reward robust MDPs via stochastic games
by: CHATTERJEE, Krishnendu, et al.
Published: (2024) -
Stochastic invariants for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2017)