scientific article; zbMATH DE number 7053361

zbMath1421.68110arXiv1109.5018MaRDI QIDQ5743484

Krishnendu Chatterjee, Monika R. Henzinger

Publication date: 10 May 2019

Full work available at URL: https://arxiv.org/abs/1109.5018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmsgraph gamesdynamic graph algorithmscomputer-aided verificationBüchi objectives

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Games involving graphs (91A43) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Knowledge base exchange: the case of OWL 2 QL ⋮ Trading performance for stability in Markov decision processes ⋮ A survey on satisfiability checking for the \(\mu \)-calculus through tree automata ⋮ Unnamed Item ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components ⋮ Quantitative fair simulation games ⋮ Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives ⋮ Assume-guarantee synthesis for digital contract signing ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Unnamed Item ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Optimal cost almost-sure reachability in POMDPs ⋮ Games for query inseparability of description logic knowledge bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of quantifiers is better than number of tape cells
• The complexity of stochastic games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• Infinite games played on finite graphs
• Weak Second‐Order Arithmetic and Finite Automata
• Alternating-time temporal logic
• The Büchi Complementation Saga
• Supervisory Control of a Class of Discrete Event Processes
• AND/OR graph heuristic search methods
• On the menbership problem for functional and multivalued dependencies in relational databases
• An On-Line Edge-Deletion Problem
• Alternation
• The complexity of probabilistic verification
• From linear time to branching time
• Computer Science Logic
• Automata-Theoretic Model Checking Revisited
• Solving Sequential Conditions by Finite-State Strategies