The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies

Published:2014 Issue: Volume: Page:242-257
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chatterjee Krishnendu,Doyen Laurent,Nain Sumit,Vardi Moshe Y.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-54830-7_16

Reference26 articles.

1. Full version of the paper. CoRR, abs/1401.3289 (2014)

2. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. JACM 49, 672–713 (2002)

3. Lecture Notes in Computer Science;C. Baier,2008

4. Cai, Y., Zhang, T.: Determinization complexities of ω automata, Technical report (2013), http://theory.stanford.edu/~tingz/tcs.pdf

5. Chatterjee, K.: Stochastic ω-regular Games. PhD thesis, UC Berkeley (2007)

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

1. Bounded-Memory Strategies in Partial-Information Games;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Quantitative verification and strategy synthesis for stochastic games;European Journal of Control;2016-07

3. Deciding Maxmin Reachability in Half-Blind Stochastic Games;Algorithmic Game Theory;2016

4. CEGAR for compositional analysis of qualitative properties in Markov decision processes;Formal Methods in System Design;2015-08-15

5. The Complexity of Synthesis from Probabilistic Components;Automata, Languages, and Programming;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP