Optimally Resilient Strategies in Pushdown Safety Games
From MaRDI portal
Publication:5089248
DOI10.4230/LIPIcs.MFCS.2020.74OpenAlexW3082937577MaRDI QIDQ5089248
Daniel Neider, Martín G. Zimmermann, Patrick Totzke
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1912.04771
Cites Work
- The theory of ends, pushdown automata, and second-order logic
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Reachability in succinct one-counter games
- Latticed-LTL synthesis in the presence of noisy inputs
- Pushdown processes: Games and model-checking
- Automata, logics, and infinite games. A guide to current research
- Synthesizing robust systems
- An automaton learning approach to solving safety games over infinite graphs
- A note on emptiness for alternating finite automata with a one-letter alphabet
- Bisimulation equivalence and regularity for real-time one-counter automata
- Recursive Markov Decision Processes and Recursive Stochastic Games
- Towards Robustness for Cyber-Physical Systems
- On synthesizing robust discrete controllers under modeling uncertainty
- Church Synthesis Problem for Noisy Input
- Reachability Games on Automatic Graphs
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Better Quality in Synthesis through Quantitative Objectives
- Infinite-state energy games
- Summaries for Context-Free Games
- Synthesizing Optimally Resilient Controllers
- Robust Linear Temporal Logic
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree
- Program Analysis Using Weighted Pushdown Systems
- Solving Sequential Conditions by Finite-State Strategies
- Foundations of Software Science and Computation Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
