Synthesis of compact strategies for coordination programs
From MaRDI portal
Recommendations
Cites work
- An Antichain Algorithm for LTL Realizability
- Better Quality in Synthesis through Quantitative Objectives
- Bounded Synthesis
- Circumscription - a form of non-monotonic reasoning
- Comparator automata in quantitative verification
- Compositional algorithms for LTL synthesis
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Formally reasoning about quality
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 2102731 (Why is no real title available?)
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- Nonmonotonic reasoning, preferential models and cumulative logics
- Owl: a library for \(\omega \)-words, automata, and LTL
- Partial orders on words, minimal elements of regular languages, and state complexity
- QUASY: quantitative synthesis tool
- SAT-Based Synthesis Methods for Safety Specs
- Synthesis of asynchronous reactive programs from temporal specifications
- Synthesis of Reactive(1) designs
- Synthesizing non-vacuous systems
- Unbeast: Symbolic Bounded Synthesis
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Synthesis of compact strategies for coordination programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535559)