Graph Games and Reactive Synthesis
From MaRDI portal
Recommendations
Cites work
- ``More deterministic vs. ``smaller Büchi automata for efficient LTL model checking
- A deterministic subexponential algorithm for solving parity games
- A survey of partial-observation stochastic parity games
- A survey of stochastic -regular games
- Abstraction-guided synthesis of synchronization
- Algorithms for Omega-Regular Games with Imperfect Information
- Alternating finite automata on -words
- Alternating-time temporal logic
- An Antichain Algorithm for LTL Realizability
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Assume-Guarantee Synthesis
- Assume-guarantee synthesis for digital contract signing
- Asynchronous -regular games with partial information
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automated Technology for Verification and Analysis
- Automating the addition of fault tolerance with discrete controller synthesis
- Better Quality in Synthesis through Quantitative Objectives
- Bounded Synthesis
- Church synthesis problem for noisy input
- Computer Science Logic
- Concurrent reachability games
- Coordination logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Deterministic generators and games for LTL fragments
- Effective synthesis of asynchronous systems from GR(1) specifications
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Energy parity games
- Environment Assumptions for Synthesis
- Exact algorithms for solving stochastic games
- Fair simulation
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
- Faster algorithms for mean-payoff games
- Finding and fixing faults
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Generalized mean-payoff and energy games
- Generalized Parity Games
- scientific article; zbMATH DE number 1670777 (Why is no real title available?)
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 1670781 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3983141 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1962853 (Why is no real title available?)
- scientific article; zbMATH DE number 2080757 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- scientific article; zbMATH DE number 1796123 (Why is no real title available?)
- scientific article; zbMATH DE number 2163041 (Why is no real title available?)
- scientific article; zbMATH DE number 2086659 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
- Improving automata generation for linear temporal logic by considering the automaton hierarchy
- Inferring Synchronization under Limited Observability
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Introduction to Discrete Event Systems
- Markov Decision Processes with Multiple Objectives
- Mathematical Foundations of Computer Science 2004
- Mean-payoff pushdown games
- Measuring and synthesizing systems in probabilistic environments
- Model Checking Real-Time Systems
- Multi-objective discounted reward verification in graphs and MDPs
- Multi-Objective Model Checking of Markov Decision Processes
- Number of quantifiers is better than number of tape cells
- On stochastic games with multiple objectives
- On the boundary of behavioral strategies
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the frequency of the transfer paradox
- On the menbership problem for functional and multivalued dependencies in relational databases
- On the synthesis of discrete controllers for timed systems
- On the synthesis of strategies in infinite games
- Parameterized synthesis
- Partial-observation stochastic games: how to win when belief fails
- Play to Test
- Positional strategies for mean payoff games
- Pushdown processes: Games and model-checking
- Qualitative analysis of partially-observable Markov decision processes
- Qualitative concurrent parity games
- Qualitative determinacy and decidability of stochastic games with signals
- Quantitative interprocedural analysis
- Quantitative multi-objective verification for probabilistic systems
- Quantitative solution of -regular games
- Quantitative stochastic parity games
- Randomness for free
- Reasoning about infinite computations
- Reasoning about strategies
- Recursive Concurrent Stochastic Games
- Safraless Compositional Synthesis
- Solving Parity Games in Big Steps
- Solving partial-information stochastic parity games
- Solving Sequential Conditions by Finite-State Strategies
- Stochastic Games
- Stochastic limit-average games are in EXPTIME
- Strategy logic
- Supervisory Control of a Class of Discrete Event Processes
- Symbolic bounded synthesis
- Synthesis for Probabilistic Environments
- Synthesis of Asynchronous Systems
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Synthesizing protocols for digital contract signing
- Synthesizing robust systems
- Temporal logic and fair discrete systems
- Temporal verification of reactive systems: response
- The Complexity of Markov Decision Processes
- The complexity of mean payoff games on graphs
- The complexity of partial-observation parity games
- The complexity of partial-observation stochastic parity games with finite-memory strategies
- The complexity of quantitative concurrent parity games
- The complexity of stochastic games
- The complexity of stochastic Müller games
- The determinacy of Blackwell games
- The element of surprise in timed games.
- The mu-calculus and Model Checking
- The theory of deadlock avoidance via discrete control
- Trading performance for stability in Markov decision processes
- Using branching time temporal logic to synthesize synchronization skeletons
- Verification, Model Checking, and Abstract Interpretation
- What is decidable about partially observable Markov decision processes with omega-regular objectives
Cited in
(58)- Decoy allocation games on graphs with temporal logic objectives
- A game-theoretic approach for the synthesis of complex systems
- Reactive synthesis from visibly register pushdown automata
- Certifying inexpressibility
- Using the compatibility analysis of logical specifications of automata to solve game problems
- Synthesizing adaptive test strategies from temporal logic specifications
- Practical synthesis of reactive systems from LTL specifications via parity games
- Strategy representation by decision trees in reactive synthesis
- Computer aided synthesis: a game-theoretic approach
- Non-zero sum games for reactive synthesis
- Synthesising features by games
- Temporal logic and fair discrete systems
- Combining Model Checking and Deduction
- The mu-calculus and Model Checking
- On synthesis of specifications with arithmetic
- Games where you can play optimally with arena-independent finite memory
- On Repetition Languages
- scientific article; zbMATH DE number 7559459 (Why is no real title available?)
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Synthesis of data word transducers
- Energy mean-payoff games
- Synthesis of Data Word Transducers
- Register-bounded synthesis
- Quantitative safety and liveness
- Subgame optimal strategies in finite concurrent games with prefix-independent objectives
- Specifiable robustness in reactive synthesis
- OmegaThreads
- Church synthesis on register automata over linearly ordered data domains
- Stackelberg-Pareto synthesis
- LTL reactive synthesis with a few hints
- Infinite separation between general and chromatic memory
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
- Half-positional objectives recognized by deterministic Büchi automata
- Graph games and logic design
- A game-theoretic approach to indistinguishability of winning objectives as user privacy
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- Synthesis with privacy against an observer
- Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
- Adapting to the behavior of environments with bounded memory
- Perspective games with notifications
- Positional \(\omega\)-regular languages
- Arena-independent memory bounds for Nash equilibria in reachability games
- Energy games over totally ordered groups
- The power of counting steps in quantitative games
- Arena-independent memory bounds for Nash equilibria in reachability games
- LTL reactive synthesis with a few hints
- Synthesis with privacy against an observer
- Games with trading of control
- Safety and liveness of quantitative automata
- Positional -regular languages
- Verification with common knowledge of rationality for graph games
- Simplicity lies in the eye of the beholder: a strategic perspective on controllers in reactive synthesis
- The non-cooperative rational synthesis problem for SPEs and -regular objectives
- Coverage games
- The complexity of games with randomised control
- Active learning of sequential transducers with side information about the domain
This page was built for publication: Graph Games and Reactive Synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176385)
