Synthesizing robust systems
From MaRDI portal
Publication:2249662
Recommendations
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 7311251 (Why is no real title available?)
- An Antichain Algorithm for LTL Realizability
- Automating the addition of fault tolerance with discrete controller synthesis
- Better Quality in Synthesis through Quantitative Objectives
- Bounded Synthesis
- Computer aided verification. 20th international conference, CAV 2008, Princeton, NJ, USA, July 7--14, 2008. Proceedings
- Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26--July 2, 2009. Proceedings
- Computer aided verification. 22nd international conference, CAV 2010, Edinburgh, UK, July 15--19, 2010. Proceedings
- Conflict-Tolerant Features
- Defining liveness
- Energy parity games
- Environment Assumptions for Synthesis
- Ranking Automata and Games for Prioritized Requirements
- Robust discrete synthesis against unspecified disturbances
- Robustness of supervisors for discrete-event systems
- Self-stabilizing systems in spite of distributed control
- Synthesis of fault-tolerant embedded systems using games: from theory to practice
- Synthesizing robust systems
- The complexity of mean payoff games on graphs
- Verification, Model Checking, and Abstract Interpretation
Cited in
(42)- Synthesizing Optimally Resilient Controllers
- scientific article; zbMATH DE number 7447730 (Why is no real title available?)
- Abstracting and refining robustness for cyber-physical systems
- System analysis and robustness
- Resilience to intermittent assumption violations in reactive synthesis
- Supervisor synthesis and throughput optimization of partially-controllable manufacturing systems
- Shield synthesis
- Robustness in Interaction Systems
- Synthesizing efficient systems in probabilistic environments
- Shield synthesis: runtime enforcement for reactive systems
- Synthesis of succinct systems
- Quantitative reductions and vertex-ranked infinite games
- Measuring and synthesizing systems in probabilistic environments
- Protocol scheduling
- On high-quality synthesis
- Synthesis of Reactive(1) designs
- A theory of change for prioritised resilient and evolvable software systems
- Assume-admissible synthesis
- Specifiable robustness in reactive synthesis
- Synthesis for multi-weighted games with branching-time winning conditions
- Robust linear temporal logic
- Graph Games and Reactive Synthesis
- Faster algorithms for mean-payoff parity games
- Optimally Resilient Strategies in Pushdown Safety Games
- Safraless LTL synthesis considering maximal realizability
- A weakness measure for GR(1) formulae
- Synthesizing non-vacuous systems
- Synthesizing efficient controllers
- On tolerance of discrete systems with respect to transition perturbations
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Vacuity in synthesis
- On synthesizing robust discrete controllers under modeling uncertainty
- Weight assignment logic
- Synthesizing robust systems
- QUASY: quantitative synthesis tool
- Synthesizing optimally resilient controllers
- Cooperative reactive synthesis
- Synthesis of Persistent Systems
- Safe environmental envelopes of discrete systems
- Reactive synthesis without regret
- Robust synthesis for real-time systems
- Optimal supervisory control of discrete event systems for cyclic tasks
This page was built for publication: Synthesizing robust systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249662)
