Automata, logics, and infinite games. A guide to current research
From MaRDI portal
Publication:1866725
DOI10.1007/3-540-36387-4zbMath1011.00037OpenAlexW2502103274MaRDI QIDQ1866725
No author found.
Publication date: 22 April 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://link.springer.de/link/service/series/0558/tocs/t2500.htm
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Related Items
Which XML schemas are streaming bounded repairable?, Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability, Adapting behaviors via reactive synthesis, Causality-based game solving, The complexity of first-order and monadic second-order logic revisited, Hierarchical information and the synthesis of distributed strategies, A focus system for the alternation-free \(\mu \)-calculus, Model theory of monadic predicate logic with the infinity quantifier, Computation as social agency: what, how and who, Linear temporal logic -- from infinite to finite horizon, From LTL to unambiguous Büchi automata via disambiguation of alternating automata, When are stochastic transition systems tameable?, On temporal logics with data variable quantifications: decidability and complexity, Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic, Parity game reductions, Logic programming approach to automata-based decision procedures, Equivalence of probabilistic \(\mu\)-calculus and p-automata, Games for active XML revisited, Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks, On the relation between reactive synthesis and supervisory control of non-terminating processes, Choice functions and well-orderings over the infinite binary tree, On equilibria in quantitative games with reachability/safety objectives, Average-energy games, Bisimulation invariant monadic-second order logic in the finite, Alternating traps in Muller and parity games, Finite-state strategies in delay games, Robust worst cases for parity games algorithms, Approximating the minimal lookahead needed to win infinite games, Optimal bounds in parametric LTL games, Connectivity games over dynamic networks, Robust, expressive, and quantitative linear temporal logics: pick any two for free, Bounded repairability of word languages, Preface to the special issue: Temporal logics of agency, Generic weakest precondition semantics from monads enriched with order, Simple strategies for Banach-Mazur games and sets of probability 1, Augmented finite transition systems as abstractions for control synthesis, Agent planning programs, Runtime enforcement of timed properties using games, Fixpoint logics over hierarchical structures, Constructive semantics for instantaneous reactions, Controlling a random population, The expressive power of analog recurrent neural networks on infinite input streams, Graph operations on parity games and polynomial-time algorithms, On strategy improvement algorithms for simple stochastic games, Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm, Coalgebraic semantics of modal logics: an overview, Observation and distinction: representing information in infinite games, Digraph width measures in parameterized algorithmics, Antichains and compositional algorithms for LTL synthesis, Strategy construction for parity games with imperfect information, Parity games on undirected graphs, A superpolynomial lower bound for strategy iteration based on snare memorization, Upper bounds on positional Paris-Harrington games, Unique sink orientations of grids, Digraph measures: Kelly decompositions, games, and orderings, On the existence of weak subgame perfect equilibria, Down the Borel hierarchy: solving Muller games via safety games, Completeness for \(\mu\)-calculi: a coalgebraic approach, The complexity of synchronizing Markov decision processes, Solving parity games via priority promotion, Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics, Synthesis of deterministic top-down tree transducers from automatic tree relations, Computable fixpoints in well-structured symbolic model checking, Strategy synthesis for multi-dimensional quantitative objectives, New deterministic algorithms for solving parity games, The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, Infinite games with finite knowledge gaps, Nash equilibria in symmetric graph games with partial observation, Doomsday equilibria for omega-regular games, Energy parity games, Feasibility analysis of sporadic real-time multiprocessor task systems, Model-checking games for fixpoint logics with partial order models, On decidability and complexity of low-dimensional robot games, Weak Muller acceptance conditions for tree automata, Weighted automata on infinite words in the context of attacker-defender games, Automata and fixed point logic: a coalgebraic perspective, A game approach to determinize timed automata, The equational theory of regular words, A delayed promotion policy for parity games, Cycle detection in computation tree logic, Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives, A Rice-style theorem for parallel automata, On satisficing in quantitative games, Quasipolynomial computation of nested fixpoints, Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Practical synthesis of reactive systems from LTL specifications via parity games, Performance heuristics for GR(1) synthesis and related algorithms, Synthesizing optimally resilient controllers, Tool support for learning Büchi automata and linear temporal logic, Branching Bisimulation Games, On the design of correct and optimal dynamical systems and games, Automata on infinite trees, Eternal vertex cover on bipartite graphs, A Game Theoretic Approach to the Analysis of Dynamic Networks, A game-theoretic approach for the synthesis of complex systems, Uniform strategies, rational relations and jumping automata, Compositional construction of most general controllers, Canonical representations for direct generation of strategies in high-level Petri games, Backtracking games and inflationary fixed points, Solving Infinite Games in the Baire Space, Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words, The mu-calculus and Model Checking, Changing a Semantics: Opportunism or Courage?, Multiplayer Cost Games with Simple Nash Equilibria, Unnamed Item, Synthesis for Structure Rewriting Systems, A Dynamic Algorithm for Reachability Games Played on Trees, The Effect of Tossing Coins in Omega-Automata, Probabilistic Weighted Automata, Optimal strategy synthesis for request-response games, Model Checking Linear-Time Properties of Probabilistic Systems, Delay Games with WMSO$$+$$U Winning Conditions, Unnamed Item, Unnamed Item, Small Resolution Proofs for QBF using Dependency Treewidth, Rewriting Strategies and Strategic Rewrite Programs, Parameterized Algorithms for Parity Games, Sequential Relational Decomposition, Reasoning About Strategies, Expressiveness and succinctness of a logic of robustness, On-the-Fly Stuttering in the Construction of Deterministic ω-Automata, Efficiently Deciding μ-Calculus with Converse over Finite Trees, Language Games, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Model Transformations in Decidability Proofs for Monadic Theories, Strategy Construction for Parity Games with Imperfect Information, The complexity of recursion theoretic games, A hierarchy of tree-automatic structures, A Note on Game Theory and Verification, A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity, The Proof Theory of Common Knowledge, Fair Termination for Parameterized Probabilistic Concurrent Systems, A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games, Model Construction and Priority Synthesis for Simple Interaction Systems, Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking, Probabilistic Model Checking for Energy-Utility Analysis, Reasoning about Strategies, A MODEL-THEORETIC CHARACTERIZATION OF MONADIC SECOND ORDER LOGIC ON INFINITE WORDS, On Monadic Theories of Monadic Predicates, A Decision Procedure for CTL* Based on Tableaux and Automata, Unnamed Item, Probabilistic Acceptors for Languages over Infinite Words, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Three notes on the complexity of model checking fixpoint logic with chop, Game Quantification Patterns, Unnamed Item, On Reachability Games of Ordinal Length, Unnamed Item, One-Time Nondeterministic Computations, Facets of Synthesis: Revisiting Church’s Problem, Synthesis from Component Libraries, On Decision Problems for Probabilistic Büchi Automata, State of Büchi Complementation, Unnamed Item, Terminal Sequence Induction via Games, Synthesizing Optimally Resilient Controllers, Monoidal-closed categories of tree automata, On Memoryless Quantitative Objectives, Extracting Winning Strategies in Update Games, Time-Optimal Winning Strategies for Poset Games, Conversation and Games, Automata, Logic and Games for the $$\lambda $$ -Calculus, Optimally Resilient Strategies in Pushdown Safety Games, OBLIGATION BLACKWELL GAMES AND P-AUTOMATA, Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions, Unnamed Item, Unnamed Item, Polynomial-Time Under-Approximation of Winning Regions in Parity Games, Decidable Extensions of Church’s Problem, Quantitative Analysis under Fairness Constraints, On Digraph Width Measures in Parameterized Algorithmics, A Characterisation of Pi^0_2 Regular Tree Languages, Streett Automata Model Checking of Higher-Order Recursion Schemes, Logical Player Types for a Theory of Play, Modular Games for Coalgebraic Fixed Point Logics, An exponential lower bound for Zadeh's pivot rule, From linear temporal logics to Büchi automata: the early and simple principle, Cost Automata, Safe Schemes, and Downward Closures, Regular model checking revisited, Taming strategy logic: non-recurrent fragments, On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words, Markov chains and unambiguous automata, Reachability games and parity games, Symbolic control for stochastic systems via finite parity games, Continuous Positional Payoffs, Playing Safe, Ten Years Later, Church synthesis on register automata over linearly ordered data domains, The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On higher-order reachability games vs may reachability, Justifications and a reconstruction of parity game solving algorithms, Realizability problem for constraint LTL, The Power-Set Construction for Tree Algebras, Submixing and shift-invariant stochastic games, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, On tolerance of discrete systems with respect to transition perturbations, A weakness measure for GR(1) formulae, On relevant equilibria in reachability games, Good-for-Game QPTL: An Alternating Hodges Semantics
