On-the-Fly Synthesis for Strictly Alternating Games

DOI10.1007/978-3-030-51831-8_6zbMath1503.68194OpenAlexW3037164082MaRDI QIDQ5100753

Shyam Lal Karra, Marco Muñiz, Kim Guldstrand Larsen, Jiří Srba

Publication date: 1 September 2022

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51831-8_6

Mathematics Subject Classification ID

Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Extended dependency graphs and efficient distributed fixed-point computation
• Computer Science Logic
• CONCUR 2005 – Concurrency Theory
• Simple linear-time algorithms for minimal fixed points

This page was built for publication: On-the-Fly Synthesis for Strictly Alternating Games