Synthesis of Reactive(1) designs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670772 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1059247 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 918600 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- A Hybrid Algorithm for LTL Games
- An Antichain Algorithm for LTL Realizability
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Better Quality in Synthesis through Quantitative Objectives
- Bounded Synthesis
- Bridging the gap between fair simulation and trace inclusion
- Computer Aided Verification
- Deterministic generators and games for LTL fragments
- Diagnostic Information for Realizability
- Environment Assumptions for Synthesis
- Minimizing Generalized Büchi Automata
- On the Merits of Temporal Testers
- Receding horizon control for temporal logic specifications
- Results on the propositional \(\mu\)-calculus
- Safety and liveness from a methodological point of view
- Safraless Compositional Synthesis
- Solving Games Without Determinization
- Solving Sequential Conditions by Finite-State Strategies
- Symbolic Implementation of Alternating Automata
- Symbolic synthesis of finite-state controllers for request-response specifications
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Synthesizing robust systems
- The existence of refinement mappings
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification by augmented finitary abstraction
- Verification, Model Checking, and Abstract Interpretation
Cited in
(80)- \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\)
- scientific article; zbMATH DE number 4085004 (Why is no real title available?)
- Synthesizing optimally resilient controllers
- Compositional construction of abstractions for infinite networks of discrete-time switched systems
- Practical synthesis of reactive systems from LTL specifications via parity games
- Ranking Automata and Games for Prioritized Requirements
- Compositional construction of most general controllers
- Synthesis from scenario-based specifications
- Static and dynamic property-preserving updates
- Memory arbiter synthesis and verification for a radar memory interface card
- Performance heuristics for GR(1) synthesis and related algorithms
- Automated generation of dynamics-based runtime certificates for high-level control
- Dynamic hierarchical reactive controller synthesis
- Adapting behaviors via reactive synthesis
- Causality-based game solving
- Mean-payoff games with \(\omega\)-regular specifications
- Synthesis of real time acceptors
- Synthesizing skeletons for reactive systems
- Refutation-based synthesis in SMT
- Cooperative reactive synthesis
- Approximate automata for omega-regular languages
- A Hybrid Algorithm for LTL Games
- GR(1)*: GR(1) specifications extended with existential guarantees
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- Synthesizing Optimally Resilient Controllers
- Explainable Reactive Synthesis
- On the relation between reactive synthesis and supervisory control of non-terminating processes
- scientific article; zbMATH DE number 2000429 (Why is no real title available?)
- On the complexity of rational verification
- Lazy synthesis
- Verification and synthesis of reactive programs
- Effective synthesis of asynchronous systems from GR(1) specifications
- scientific article; zbMATH DE number 7204449 (Why is no real title available?)
- scientific article; zbMATH DE number 6917935 (Why is no real title available?)
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- Synthesising features by games
- scientific article; zbMATH DE number 7439733 (Why is no real title available?)
- Agent planning programs
- Specifiable robustness in reactive synthesis
- Optimal multirate sampling in symbolic models for incrementally stable switched systems
- Augmented finite transition systems as abstractions for control synthesis
- Shield synthesis
- scientific article; zbMATH DE number 7649930 (Why is no real title available?)
- Linear temporal logic -- from infinite to finite horizon
- Qualitative approximate behavior composition
- Most General Property-Preserving Updates
- Assume-Guarantee Synthesis
- Finite abstractions with robustness margins for temporal logic-based control synthesis
- Reactive Synthesis Without Regret
- scientific article; zbMATH DE number 2112979 (Why is no real title available?)
- Symbolic model checking in non-Boolean domains
- On-the-fly informed search of non-blocking directed controllers
- On synthesis of specifications with arithmetic
- Compositional and symbolic synthesis of reactive controllers for multi-agent systems
- Code aware resource management
- Verification, Model Checking, and Abstract Interpretation
- Flexible FOND Planning with Explicit Fairness Assumptions
- Interpolation-based GR(1) assumptions refinement
- Efficient Algorithms for Omega-Regular Energy Games
- Dissecting \texttt{ltlsynt}
- Finite-trace and generalized-reactivity specifications in temporal synthesis
- Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis
- Uncertainty in runtime verification: a survey
- Towards an efficient implementation of a tableau method for reactive safety specifications
- On tolerance of discrete systems with respect to transition perturbations
- Efficient reactive synthesis using mode decomposition
- The complexity of LTL rational synthesis
- Alternating good-for-MDPs automata
- Tableaux for realizability of safety specifications
- Reactive synthesis for relay-explorer consensus with intermittent communication
- GR(1)*: GR(1) specifications extended with existential guarantees
- Boolean abstractions for realizability modulo theories
- Synthesis of compact strategies for coordination programs
- LTL reactive synthesis with a few hints
- Synthesizing permissive winning strategy templates for parity games
- Symbolic solution of Emerson-Lei games for reactive synthesis
- Realizability modulo theories
- A weakness measure for GR(1) formulae
- A weakness measure for GR(1) formulae
- Extended bounded response LTL: a new safety fragment for efficient reactive synthesis
This page was built for publication: Synthesis of Reactive(1) designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439954)
