Author:
Baier Christel,Bertrand Nathalie,Größer Marcus
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Baier, C., Größer, M.: Recognizing ω-regular languages with probabilistic automata. In: Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005), pp. 137–146. IEEE Computer Society Press, Los Alamitos (2005)
2. Lecture Notes in Computer Science;D. Bustan,2004
3. Cassandra, A.R.: A survey of POMD applications. Presented at the AAAI Fall Symposium (1998),
http://pomdp.org/pomdp/papers/applications.pdf
4. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857–907 (1995)
5. de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: Proc. Workshop on Probabilistic Methods in Verification (ProbMiV 1999), Birmingham University, Research Report CSR-99-9, pp. 19–32 (1999)
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Probabilistic Rabin Tree Theorem*;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Model checking hyperproperties for Markov decision processes;Information and Computation;2022-11
3. Qualitative Planning in Imperfect Information Games with Active Sensing and Reactive Sensor Attacks: Cost of Unawareness;2021 60th IEEE Conference on Decision and Control (CDC);2021-12-14
4. Probabilistic Model Checking and Autonomy;Annual Review of Control, Robotics, and Autonomous Systems;2021-12-06
5. Probabilistic Hyperproperties of Markov Decision Processes;Automated Technology for Verification and Analysis;2020