Reachability games on automatic graphs

DOI10.1007/978-3-642-18098-9_24zbMATH Open1297.68159OpenAlexW1567370363MaRDI QIDQ3073641FDOQ3073641

Daniel Neider

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_24

Recommendations

• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• A constraint-based approach to solving games on infinite graphs
• scientific article; zbMATH DE number 2086664
• Infinite games played on finite graphs
• Regular strategies in pushdown reachability games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Automata and formal grammars in connection with logical questions (03D05) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Regular Model Checking using Widening Techniques
• Learning regular sets from queries and counterexamples
• Concurrent reachability games
• Title not available (Why is that?)
• Symbolic computational techniques for solving games
• Title not available (Why is that?)
• Regular model checking using inference of regular languages
• Finite presentations of infinite structures: Automata and interpretations
• Tools and Algorithms for the Construction and Analysis of Systems

Cited In (5)

• Resource Reachability Games on Pushdown Graphs
• Play to Test
• Graph Games and Reactive Synthesis
• Optimally Resilient Strategies in Pushdown Safety Games
• Self enforceable paths in extensive form games

Uses Software

• libalf

This page was built for publication: Reachability games on automatic graphs

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