scientific article; zbMATH DE number 1759605
From MaRDI portal
Publication:4536596
zbMath0999.68124MaRDI QIDQ4536596
Moshe Y. Vardi, P. S. Thiagarajan, Orna Kupferman, P. Madhusudan
Publication date: 28 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (18)
Complexity results on branching-time pushdown model checking ⋮ Reasoning about equilibria in game-like concurrent systems ⋮ Synthesis of large dynamic concurrent programs from dynamic specifications ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Synthesis for Multi-weighted Games with Branching-Time Winning Conditions ⋮ Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ Supervisory control and reactive synthesis: a comparative introduction ⋮ On proving that an unsafe controller is not proven safe ⋮ Harmonization of interacting automata ⋮ Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation ⋮ Maximally permissive controlled system synthesis for non-determinism and modal logic ⋮ Pushdown module checking ⋮ Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems ⋮ Quantifying Bounds in Strategy Logic ⋮ A Compositional Framework for Controller Synthesis ⋮ A decidable class of problems for control under partial observation ⋮ Iterated Boolean games ⋮ Compositional construction of most general controllers
This page was built for publication:
