Bounded Synthesis
From MaRDI portal
Publication:3510817
DOI10.1007/978-3-540-75596-8_33zbMath1141.68491MaRDI 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
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On High-Quality Synthesis, Real-time policy enforcement with metric first-order temporal logic, BOCoSy: Small but Powerful Symbolic Output-Feedback Control, Tableaux for realizability of safety specifications, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Synthesis of large dynamic concurrent programs from dynamic specifications, 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, Doomsday equilibria for omega-regular games, Synchronous counting and computational algorithm design, 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, Compositional synthesis of modular systems, 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, Synthesizing Non-Vacuous Systems, Unbeast: Symbolic Bounded Synthesis, 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, ATL* Satisfiability Is 2EXPTIME-Complete
Cites Work
