Bounded Synthesis
From MaRDI portal
Publication:3510817
DOI10.1007/978-3-540-75596-8_33zbMath1141.68491OpenAlexW4253380258MaRDI QIDQ3510817
Publication date: 3 July 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_33
Related Items
Lazy Synthesis, Bounded Synthesis for Petri Games, Graph Games and Reactive Synthesis, Compositional and symbolic synthesis of reactive controllers for multi-agent systems, Linear temporal logic -- from infinite to finite horizon, Compositional synthesis of modular systems, Synthesis of large dynamic concurrent programs from dynamic specifications, Safraless LTL synthesis considering maximal realizability, Synchronous counting and computational algorithm design, Real-time policy enforcement with metric first-order temporal logic, BOCoSy: Small but Powerful Symbolic Output-Feedback Control, Synthesizing Non-Vacuous Systems, Unnamed Item, Tableaux for realizability of safety specifications, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Unnamed Item, ATL* Satisfiability Is 2EXPTIME-Complete, Synthesis of Reactive(1) designs, Antichains and compositional algorithms for LTL synthesis, Symbolic bounded synthesis, Down the Borel hierarchy: solving Muller games via safety games, 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, Unbeast: Symbolic Bounded Synthesis, Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control, Encodings of Bounded Synthesis, The complexity of counting models of linear-time temporal logic, Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\), Synthesizing robust systems, Doomsday equilibria for omega-regular games, On High-Quality Synthesis, Reactive synthesis with maximum realizability of linear temporal logic specifications, Non-prenex QBF Solving Using Abstraction, Vacuity in synthesis, Unnamed Item, Unnamed Item, Can we build it: formal synthesis of control strategies for cooperative driver assistance systems, Synthesizing structured reactive programs via deterministic tree automata, Synthesis of succinct systems
Cites Work
