Update games and update networks

DOI10.1016/S1570-8667(03)00006-6MaRDI QIDQ876693zbMATH OpenFDO

Authors Michael J. Dinneen, Bakhadyr Khoussainov

Publication date 26 April 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

infinite gamesupdate networks

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1696528
• scientific article; zbMATH DE number 1953100
• Computer Science Logic
• Infinite games played on finite graphs
• Infinite games on finitely coloured graphs with applications to automata on infinite trees

Cites work

• Infinite games played on finite graphs
• McNaughton games and extracting strategies for concurrent programs
• On the complexity of some two-person perfect-information games
• Solving Sequential Conditions by Finite-State Strategies

Cited in

(2)

• scientific article; zbMATH DE number 1696528 (Why is no real title available?)
• Extracting winning strategies in update games

This page was built for publication: Update games and update networks

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