scientific article; zbMATH DE number 1759605

MaRDI QIDQ4536596zbMATH OpenFDO

Authors Orna Kupferman, Parthasarathy Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi

Publication date 28 November 2002

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Synthesis for Probabilistic Environments
• Computer Science Logic
• scientific article; zbMATH DE number 2163041
• scientific article; zbMATH DE number 2112979
• Reactive synthesis from signal temporal logic specifications

Cited in

(27)

• A decidable class of problems for control under partial observation
• Reactive synthesis for robotic swarms
• Supervisory control and reactive synthesis: a comparative introduction
• Iterated Boolean games
• Compositional construction of most general controllers
• Complexity results on branching-time pushdown model checking
• From model checking to equilibrium checking: reactive modules for rational verification
• A multi-alternative approach to control in open systems: origins, current state, and future prospects
• Estimator-based reactive synthesis under incomplete information
• A compositional framework for controller synthesis
• Reasoning about equilibria in game-like concurrent systems
• Synthesis of large dynamic concurrent programs from dynamic specifications
• Synthesis for Probabilistic Environments
• Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
• Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
• scientific article; zbMATH DE number 1759436 (Why is no real title available?)
• Quantifying Bounds in Strategy Logic
• Synthesis for multi-weighted games with branching-time winning conditions
• Maximally permissive controlled system synthesis for non-determinism and modal logic
• Computer Science Logic
• CONCUR 2004 - Concurrency Theory
• Reasoning about Quality and Fuzziness of Strategic Behaviors
• On proving that an unsafe controller is not proven safe
• Adapting to the behavior of environments with bounded memory
• Arbitrary-arity tree automata for QCTL
• Harmonization of interacting automata
• Pushdown module checking

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536596)