A Simple Algorithm for Solving Qualitative Probabilistic Parity Games-Reference-Cited by-同舟云学术

A Simple Algorithm for Solving Qualitative Probabilistic Parity Games

Published:2016 Issue: Volume: Page:291-311
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Hahn Ernst Moritz,Schewe Sven,Turrini Andrea,Zhang Lijun

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-41540-6_16

Reference36 articles.

1. Lecture Notes in Computer Science;A Bianco,1995

2. Chatterjee, K.: Stochastic $$\omega $$-regular games. Ph.D. thesis, University of California at Berkeley (2007)

3. Lecture Notes in Computer Science;K Chatterjee,2014

4. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Strategy improvement for concurrent reachability games. In: QEST, pp. 291–300. IEEE Computer Society (2006)

5. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Qualitative concurrent parity games. ACM Trans. Comput. Log. 12(4), 28 (2011)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning;Tools and Algorithms for the Construction and Analysis of Systems;2023

2. EPMC Gets Knowledge in Multi-agent Systems;Lecture Notes in Computer Science;2022

3. On Correctness, Precision, and Performance in Quantitative Verification;Leveraging Applications of Formal Methods, Verification and Validation: Tools and Trends;2021

4. An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space;International Journal on Software Tools for Technology Transfer;2019-02-25

5. The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models;Tools and Algorithms for the Construction and Analysis of Systems;2019