Latticed-LTL synthesis in the presence of noisy inputs
From MaRDI portal
Publication:1677194
DOI10.1007/s10626-017-0242-0zbMath1374.93029OpenAlexW4252384962MaRDI QIDQ1677194
Shaull Almagor, Orna Kupferman
Publication date: 10 November 2017
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-017-0242-0
Related Items
Multi-Valued Reasoning about Reactive Systems, Reasoning about Quality and Fuzziness of Strategic Behaviors, Unnamed Item, Optimally Resilient Strategies in Pushdown Safety Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating finite automata on \(\omega\)-words
- The complexity of two-player games of incomplete information
- Verified software: Theories, tools, experiments. Second international conference, VSTTE 2008, Toronto, Canada, October 6--9, 2008. Proceedings
- Borel determinacy
- Reasoning about infinite computations
- Robust discrete synthesis against unspecified disturbances
- On synthesizing robust discrete controllers under modeling uncertainty
- Church Synthesis Problem for Noisy Input
- Minimum Attention Controller Synthesis for Omega-Regular Objectives
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Ranking Automata and Games for Prioritized Requirements
- Controller Synthesis with Budget Constraints
- Quantitative Languages
- LATTICED SIMULATION RELATIONS AND GAMES
- Algorithms for Omega-Regular Games with Imperfect Information
- Better Quality in Synthesis through Quantitative Objectives
- An Antichain Algorithm for LTL Realizability
- Church's Problem Revisited
- Formalizing and Reasoning about Quality
- Model Checking Quantitative Linear Time Logic
- Lattice Automata
- Solving Parity Games in Big Steps
