scientific article; zbMATH DE number 1953100

MaRDI QIDQ4414504zbMATH OpenFDO

Authors Hajime Ishihara, Bakhadyr Khoussainov

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730270.htm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Games involving graphs (91A43)

Recommendations

• Infinite games played on finite graphs
• Infinite Games on Finite Graphs Using Grossone
• Infinite games on finite graphs using grossone
• scientific article; zbMATH DE number 2024632
• The complexity of infinitely repeated alternating move games
• Infinite Deterministic Graphical Games
• Algorithms – ESA 2005
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• A constraint-based approach to solving games on infinite graphs
• Computer Science Logic

Cited in

(14)

• Infinite games played on finite graphs
• The complexity of mean payoff games on graphs
• Weak observable liveness and infinite games on finite graphs
• McNaughton games and extracting strategies for concurrent programs
• Infinite games on finite graphs using grossone
• Extracting winning strategies in update games
• scientific article; zbMATH DE number 1735822 (Why is no real title available?)
• scientific article; zbMATH DE number 2024632 (Why is no real title available?)
• scientific article; zbMATH DE number 2081020 (Why is no real title available?)
• Deciding Parity Games in Quasi-polynomial Time
• Exponential time algorithms for deciding regular games
• Deciding regular games: a playground for exponential time algorithms
• Combinatorial structure and randomized subexponential algorithms for infinite games
• Update games and update networks

This page was built for publication:

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