Uniform strategies, rational relations and jumping automata

DOI10.1016/j.ic.2015.03.012zbMath1319.68140MaRDI QIDQ2346407

Bastien Maubert, Laura Bozzelli, 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

games; imperfect information; rational relations; jumping automata; logics of knowledge and time; uniform strategies

Mathematics Subject Classification ID

91A80: Applications of game theory

68Q45: Formal languages and automata

03B42: Logics of knowledge and belief (including belief change)

03D05: Automata and formal grammars in connection with logical questions

68Q60: Specification and verification (program logics, model checking, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

03B44: Temporal logic

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information tracking in games on graphs
• Synchronized rational relations of finite and infinite words
• The complexity of two-player games of incomplete information
• CCS expressions, finite state processes, and three problems of equivalence
• Alternating automata on infinite trees
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Efficient minimization of deterministic weak \(\omega\)-automata
• Module checking
• Automata, logics, and infinite games. A guide to current research
• Strategy construction for parity games with imperfect information
• Verification of concurrent programs: The automata-theoretic framework
• Solving Counter Parity Games
• Jumping Automata for Uniform Strategies
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• Decision problems among the main subfamilies of rational relations
• Alternating-time temporal logic
• Asynchronous Omega-Regular Games with Partial Information
• Algorithms for Omega-Regular Games with Imperfect Information
• Alternation
• Computer Aided Verification
• An automata-theoretic approach to branching-time model checking
• A GENERAL NOTION OF UNIFORM STRATEGIES
• On Relations Defined by Generalized Finite Automata
• CONCUR 2005 – Concurrency Theory
• Lower bounds for multiplayer noncooperative games of incomplete information