Unbeast: Symbolic Bounded Synthesis
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- The complexity of counting models of linear-time temporal logic
- Linear temporal logic -- from infinite to finite horizon
- Practical synthesis of reactive systems from LTL specifications via parity games
- Synthesis of succinct systems
- Can we build it: formal synthesis of control strategies for cooperative driver assistance systems
- Unisex: A unix-based symbolic executor for pascal
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Encodings of bounded synthesis
- Bounded Synthesis
- Symbolic bounded synthesis
- scientific article; zbMATH DE number 7455737 (Why is no real title available?)
- scientific article; zbMATH DE number 7278100 (Why is no real title available?)
- Unbeast
- 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
- Synthesis of compact strategies for coordination programs
- Symbolic solution of Emerson-Lei games for reactive synthesis
- Towards an efficient implementation of a tableau method for reactive safety specifications
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)