Uniform strategies, rational relations and jumping automata

DOI10.1016/J.IC.2015.03.012MaRDI QIDQ2346407zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, Bastien Maubert, Sophie Pinchinat

Publication date 1 June 2015

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2015.03.012

zbMATH Keywords

gamesimperfect informationjumping automatalogics of knowledge and timerational relationsuniform strategies

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of game theory (91A80)

Recommendations

• Jumping Automata for Uniform Strategies
• A general notion of uniform strategies
• The complexity of synthesizing uniform strategies
• Partial information and uniform strategies
• Strategy Logic

Cites work

• A general notion of uniform strategies
• Algorithms for Omega-Regular Games with Imperfect Information
• Alternating automata on infinite trees
• Alternating-time temporal logic
• Alternation
• An automata-theoretic approach to branching-time model checking
• Asynchronous -regular games with partial information
• ATL with strategy contexts: expressiveness and model checking
• Automata, logics, and infinite games. A guide to current research
• CCS expressions, finite state processes, and three problems of equivalence
• Computer Aided Verification
• CONCUR 2005 – Concurrency Theory
• Decision problems among the main subfamilies of rational relations
• Efficient minimization of deterministic weak -automata
• scientific article; zbMATH DE number 5869590 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1223729 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1500666 (Why is no real title available?)
• scientific article; zbMATH DE number 2086675 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Information tracking in games on graphs
• Jumping Automata for Uniform Strategies
• Lower bounds for multiplayer noncooperative games of incomplete information
• Module checking
• On Relations Defined by Generalized Finite Automata
• On the power of imperfect information
• Opacity issues in games with imperfect information
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• Solving counter parity games
• Strategy construction for parity games with imperfect information
• Synchronized rational relations of finite and infinite words
• The complexity of reasoning about knowledge and time. I: Lower bounds
• The complexity of two-player games of incomplete information
• The tree of knowledge in action: towards a common perspective
• Verification of concurrent programs: The automata-theoretic framework

Cited in

(8)

• DEL-based epistemic planning: decidability and complexity
• Multi-player games with LDL goals over finite traces
• Model-checking graded computation-tree logic with finite path semantics
• Observation and distinction: representing information in infinite games
• Jumping Automata for Uniform Strategies
• The complexity of synthesizing uniform strategies
• A general notion of uniform strategies
• Games with -automatic preference relations

This page was built for publication: Uniform strategies, rational relations and jumping automata

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