scientific article; zbMATH DE number 1759605
From MaRDI portal
Publication:4536596
zbMATH Open0999.68124MaRDI QIDQ4536596FDOQ4536596
Moshe Y. Vardi, P. S. Thiagarajan, Orna Kupferman, Parthasarathy Madhusudan
Publication date: 28 November 2002
Title of this publication is not available (Why is that?)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (20)
- Iterated Boolean games
- Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
- A multi-alternative approach to control in open systems: origins, current state, and future prospects
- On proving that an unsafe controller is not proven safe
- Quantifying Bounds in Strategy Logic
- Supervisory control and reactive synthesis: a comparative introduction
- Compositional construction of most general controllers
- Complexity results on branching-time pushdown model checking
- A Compositional Framework for Controller Synthesis
- A decidable class of problems for control under partial observation
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
- From model checking to equilibrium checking: reactive modules for rational verification
- Reasoning about equilibria in game-like concurrent systems
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Synthesis of large dynamic concurrent programs from dynamic specifications
- Harmonization of interacting automata
- Title not available (Why is that?)
- Pushdown module checking
- Maximally permissive controlled system synthesis for non-determinism and modal logic
- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
Recommendations
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)
