A simple algorithm for solving qualitative probabilistic parity games

DOI10.1007/978-3-319-41540-6_16MaRDI QIDQ4633558zbMATH OpenOpenAlexFDO

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

Publication date 3 May 2019

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41540-6_16

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• Computer Science Logic
• Quantitative stochastic parity games
• Quantitative verification and strategy synthesis for stochastic games
• Qualitative concurrent parity games: bounded rationality
• The complexity of partial-observation stochastic parity games with finite-memory strategies

Cited in

(4)

• scientific article; zbMATH DE number 6490915 (Why is no real title available?)
• QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
• Model-Free Reinforcement Learning for Stochastic Parity Games
• Identity-Based Cryptosystems and Quadratic Residuosity

This page was built for publication: A simple algorithm for solving qualitative probabilistic parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633558)