Synthesis of compact strategies for coordination programs
From MaRDI portal
Publication:6535559
DOI10.1007/978-3-030-99524-9_3zbMath1547.68445MaRDI QIDQ6535559
Kedar S. Namjoshi, Nisarg Patel
Publication date: 23 January 2024
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Artificial intelligence for robotics (68T40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of Reactive(1) designs
- Partial orders on words, minimal elements of regular languages, and state complexity
- Circumscription - a form of non-monotonic reasoning
- Nonmonotonic reasoning, preferential models and cumulative logics
- Comparator automata in quantitative verification
- SAT-Based Synthesis Methods for Safety Specs
- Synthesizing Non-Vacuous Systems
- QUASY: Quantitative Synthesis Tool
- Unbeast: Symbolic Bounded Synthesis
- Formally Reasoning About Quality
- Bounded Synthesis
- Better Quality in Synthesis through Quantitative Objectives
- An Antichain Algorithm for LTL Realizability
- Compositional Algorithms for LTL Synthesis
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Verification, Model Checking, and Abstract Interpretation
- Synthesis of asynchronous reactive programs from temporal specifications
- Owl: a library for \(\omega \)-words, automata, and LTL
This page was built for publication: Synthesis of compact strategies for coordination programs
