Unbeast: Symbolic Bounded Synthesis
From MaRDI portal
Publication:3000656
DOI10.1007/978-3-642-19835-9_25zbMath1316.68073OpenAlexW1483600339MaRDI QIDQ3000656
Publication date: 19 May 2011
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19835-9_25
Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Linear temporal logic -- from infinite to finite horizon, High-level representation of benchmark families for Petri games, Real-time policy enforcement with metric first-order temporal logic, Tableaux for realizability of safety specifications, Unnamed Item, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems, Encodings of Bounded Synthesis, The complexity of counting models of linear-time temporal logic, Unbeast, Practical synthesis of reactive systems from LTL specifications via parity games, Unnamed Item, Can we build it: formal synthesis of control strategies for cooperative driver assistance systems, Synthesis of succinct systems
Uses Software
Cites Work
