Unbeast: Symbolic Bounded Synthesis
From MaRDI portal
Publication:3000656
DOI10.1007/978-3-642-19835-9_25zbMATH Open1316.68073OpenAlexW1483600339MaRDI QIDQ3000656FDOQ3000656
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)
Cites Work
Cited In (19)
- Title not available (Why is that?)
- Unbeast
- Encodings of Bounded Synthesis
- Practical synthesis of reactive systems from LTL specifications via parity games
- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems
- The complexity of counting models of linear-time temporal logic
- High-level representation of benchmark families for Petri games
- Synthesis of succinct systems
- Bounded Synthesis
- Tableaux for realizability of safety specifications
- Title not available (Why is that?)
- Symbolic bounded synthesis
- Linear temporal logic -- from infinite to finite horizon
- Symbolic solution of Emerson-Lei games for reactive synthesis
- Towards an efficient implementation of a tableau method for reactive safety specifications
- Can we build it: formal synthesis of control strategies for cooperative driver assistance systems
- Real-time policy enforcement with metric first-order temporal logic
- Synthesis of compact strategies for coordination programs
- Unisex: A unix-based symbolic executor for pascal
Uses Software
Recommendations
This page was built for publication: Unbeast: Symbolic Bounded Synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000656)
