Pages that link to "Item:Q5898629"

The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5898629):

Displaying 46 items.

• CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems (Q397407) (← links)
• Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
• Synthesis of Reactive(1) designs (Q439954) (← links)
• Synthesis from scenario-based specifications (Q439960) (← links)
• Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
• Symbolic bounded synthesis (Q453535) (← links)
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic (Q681718) (← links)
• Verifying specifications in the language L against temporal properties nonexpressible in this language (Q844345) (← links)
• Agent planning programs (Q899440) (← links)
• Harmonization of interacting automata (Q904417) (← links)
• Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
• Augmented finite transition systems as abstractions for control synthesis (Q1693823) (← links)
• Robust control for signal temporal logic specifications using discrete average space robustness (Q1737745) (← links)
• GR(1)*: GR(1) specifications extended with existential guarantees (Q1982646) (← links)
• Funnel control for fully actuated systems under a fragment of signal temporal logic specifications (Q2061223) (← links)
• Incorporating monitors in reactive synthesis without paying the price (Q2147214) (← links)
• Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) (Q2249659) (← links)
• Synthesizing robust systems (Q2249662) (← links)
• Performance heuristics for GR(1) synthesis and related algorithms (Q2303873) (← links)
• Safety synthesis for incrementally stable switched systems using discretization-free multi-resolution abstractions (Q2303884) (← links)
• An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← links)
• Synthesis of succinct systems (Q2353397) (← links)
• Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
• LTL receding horizon control for finite deterministic systems (Q2628417) (← links)
• Index appearance record with preorders (Q2675810) (← links)
• Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
• Effective Synthesis of Asynchronous Systems from GR(1) Specifications (Q2891421) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
• Index Appearance Record for Transforming Rabin Automata into Parity Automata (Q3303907) (← links)
• Optimal Translation of LTL to Limit Deterministic Automata (Q3303923) (← links)
• Diagnostic Information for Realizability (Q5452707) (← links)
• A weakness measure for GR(1) formulae (Q5918136) (← links)
• Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games (Q5919894) (← links)
• Reactive synthesis for relay-explorer consensus with intermittent communication (Q6175602) (← links)
• Realizability problem for constraint LTL (Q6178458) (← links)
• Synthesis of compact strategies for coordination programs (Q6535559) (← links)
• Boolean abstractions for realizability modulo theories (Q6535690) (← links)
• GR(1)*: GR(1) specifications extended with existential guarantees (Q6535944) (← links)
• Computing adequately permissive assumptions for synthesis (Q6536127) (← links)
• Realizability modulo theories (Q6561346) (← links)
• Towards the exact complexity of realizability for safety LTL (Q6615568) (← links)
• Fair \(\omega \)-regular games (Q6629447) (← links)
• Symbolic solution of Emerson-Lei games for reactive synthesis (Q6629450) (← links)
• Towards an efficient implementation of a tableau method for reactive safety specifications (Q6643466) (← links)
• Extended bounded response LTL: a new safety fragment for efficient reactive synthesis (Q6661746) (← links)