Modal and mixed specifications: key decision problems and their complexities (Q3550702): Difference between revisions

@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Strategy Construction for Parity Games with Imperfect Information
+Normal rank
@@ Property / cites work @@
+Infinite games on finitely coloured graphs with applications to automata on infinite trees
+Normal rank
@@ Property / cites work @@
+Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
+Normal rank
@@ Property / cites work @@
+EXPTIME-complete Decision Problems for Modal and Mixed Specifications
+Normal rank
@@ Property / cites work @@
+Complexity of Decision Problems for Mixed and Modal Specifications
+Normal rank
@@ Property / cites work @@
+On the Complexity of Semantic Self-minimization
@@ Property / cites work: On the Complexity of Semantic Self-minimization / rank @@
+Normal rank
@@ Property / cites work @@
+State explosion in almost-sure probabilistic reachability
+Normal rank
@@ Property / cites work @@
+Three theorems on phrase structure grammars of type 1
+Normal rank
@@ Property / cites work @@
+A finite model theorem for the propositional \(\mu\)-calculus
+Normal rank
@@ Property / cites work @@
+Refinement is complete for implementations
@@ Property / cites work: Refinement is complete for implementations / rank @@
+Normal rank
@@ Property / cites work @@
+Labelled transition systems as a Stone space
@@ Property / cites work: Labelled transition systems as a Stone space / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank