Computing Weakest Strategies for Safety Games of Imperfect Information (Q3617754): Difference between revisions

@@ Property / cites work @@
+Permissive strategies: from parity games to safety games
+Normal rank
@@ Property / cites work @@
+Strategy Construction for Parity Games with Imperfect Information
+Normal rank
@@ Property / cites work @@
+Efficient On-the-Fly Algorithms for Partially Observable Timed Games
+Normal rank
@@ Property / cites work @@
+Algorithms for Omega-Regular Games with Imperfect Information
+Normal rank
@@ Property / cites work @@
+Safraless Compositional Synthesis
@@ Property / cites work: Safraless Compositional Synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite Games
@@ Property / cites work: Infinite Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q4205072
@@ Property / cites work: Q4205072 / rank @@
+Normal rank
@@ Property / cites work @@
+Supervisory Control of a Class of Discrete Event Processes
+Normal rank
@@ Property / cites work @@
+The complexity of two-player games of incomplete information
+Normal rank
@@ Property / cites work @@
+Q2816007
@@ Property / cites work: Q2816007 / rank @@
+Normal rank
@@ Property / cites work @@
+Antichains: A New Algorithm for Checking Universality of Finite Automata
+Normal rank
@@ Property / cites work @@
+Hybrid Systems: Computation and Control
@@ Property / cites work: Hybrid Systems: Computation and Control / rank @@
+Normal rank