The following pages link to (Q4205072):
Displaying 50 items.
- Synthesis with rational environments (Q314471) (← links)
- Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- Finding and fixing faults (Q414907) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Moving in a network under random failures: a complexity analysis (Q433350) (← links)
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation (Q434470) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- Reliability-aware automatic composition approach for web services (Q439793) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- Computable concurrent processes (Q673972) (← links)
- Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic (Q681718) (← links)
- Conversation protocols: a formalism for specification and verification of reactive electronic services (Q703491) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Assume-guarantee synthesis for digital contract signing (Q736809) (← links)
- Program repair without regret (Q746769) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- Adapting behaviors via reactive synthesis (Q832238) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- Verifying specifications in the language L against temporal properties nonexpressible in this language (Q844345) (← links)
- Supervision based on place invariants: a survey (Q858151) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- Synthesizing bounded-time 2-phase fault recovery (Q903518) (← links)
- Harmonization of interacting automata (Q904417) (← links)
- Strategy logic (Q979080) (← links)
- From liveness to promptness (Q1039845) (← links)
- Control of \(\omega\)-automata under state fairness assumptions (Q1128704) (← links)
- On undecidability of propositional temporal logics on trace systems (Q1199555) (← links)
- Proving partial order properties (Q1322161) (← links)
- Planning control rules for reactive agents (Q1389598) (← links)
- Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
- Imperfect information in reactive modules games (Q1641035) (← links)
- Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- Augmented finite transition systems as abstractions for control synthesis (Q1693823) (← links)
- Automation of fault-tolerant graceful degradation (Q1733388) (← links)
- Energy parity games (Q1758152) (← links)
