Pages that link to "Item:Q1866725"
From MaRDI portal
The following pages link to Automata, logics, and infinite games. A guide to current research (Q1866725):
Displayed 50 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Alternating traps in Muller and parity games (Q389948) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- Down the Borel hierarchy: solving Muller games via safety games (Q477197) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- On strategy improvement algorithms for simple stochastic games (Q635740) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Backtracking games and inflationary fixed points (Q817842) (← links)
- Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability (Q832033) (← links)
- Adapting behaviors via reactive synthesis (Q832238) (← links)
- Causality-based game solving (Q832242) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Simple strategies for Banach-Mazur games and sets of probability 1 (Q897645) (← links)
- Agent planning programs (Q899440) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- On the design of correct and optimal dynamical systems and games (Q1028979) (← links)
- Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- Parity game reductions (Q1656552) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- Augmented finite transition systems as abstractions for control synthesis (Q1693823) (← links)
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm (Q1706164) (← links)
- Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)