Bounded Synthesis
From MaRDI portal
Recommendations
Cites work
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1500652 (Why is no real title available?)
- scientific article; zbMATH DE number 1754607 (Why is no real title available?)
Cited in
(67)- Compositional and symbolic synthesis of reactive controllers for multi-agent systems
- Safraless LTL synthesis considering maximal realizability
- The complexity of counting models of linear-time temporal logic
- Vacuity in synthesis
- Linear temporal logic -- from infinite to finite horizon
- Live synthesis
- Compositional synthesis of modular systems
- Bounded synthesis for Streett, Rabin, and \(\mathrm{CTL}^*\)
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- Synthesizing robust systems
- Reactive synthesis with maximum realizability of linear temporal logic specifications
- Synthesizing structured reactive programs via deterministic tree automata
- Synthesis of succinct systems
- Non-prenex QBF solving using abstraction
- Can we build it: formal synthesis of control strategies for cooperative driver assistance systems
- Lazy synthesis
- Parameterized synthesis
- Synthesizing non-vacuous systems
- On bounded specifications
- Unbeast: Symbolic Bounded Synthesis
- Temporal synthesis for bounded systems and environments
- Graph Games and Reactive Synthesis
- Approximate automata for omega-regular languages
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Semantic labelling and learning for parity game solving in LTL synthesis
- Encodings of bounded synthesis
- Bounded synthesis for Petri games
- Synthesis of large dynamic concurrent programs from dynamic specifications
- ATL* Satisfiability Is 2EXPTIME-Complete
- scientific article; zbMATH DE number 1332686 (Why is no real title available?)
- Synthesis of Reactive(1) designs
- Antichains and compositional algorithms for LTL synthesis
- Symbolic bounded synthesis
- Automated synthesis of distributed self-stabilizing protocols
- Real-time synthesis is hard!
- Bounded Cycle Synthesis
- Fast, flexible, and minimal CTL synthesis via SMT
- Synthesis of succinct systems
- Down the Borel hierarchy: solving Muller games via safety games
- The complexity of transducer synthesis from multi-sequential specifications
- Symmetric synthesis
- On high-quality synthesis
- Safraless Compositional Synthesis
- Register-bounded synthesis
- Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis
- Real-time policy enforcement with metric first-order temporal logic
- Bounded synthesis of reactive programs
- Bounded synthesis of register transducers
- BOCoSy: Small but Powerful Symbolic Output-Feedback Control
- Tableaux for realizability of safety specifications
- Synthesizing approximate implementations for unrealizable specifications
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words
- Synthesis of compact strategies for coordination programs
- Boolean abstractions for realizability modulo theories
- Taming large bounds in synthesis from bounded-liveness specifications
- LTL reactive synthesis with a few hints
- Synthesis with privacy against an observer
- Adapting to the behavior of environments with bounded memory
- Closure certificates
- LTL reactive synthesis with a few hints
- Synthesis with privacy against an observer
- Towards the usage of window counting constraints in the synthesis of reactive systems to reduce state space explosion
- Closure certificates
- Towards the usage of window counting constraints in the synthesis of reactive systems to reduce state space explosion
- Positional-player games
- Synchronous counting and computational algorithm design
This page was built for publication: Bounded Synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510817)
