The Complexity of CTL* + Linear Past (Q5458359): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-78499-9_14
+Normal rank
@@ Property / OpenAlex ID @@
+W1562463698
@@ Property / OpenAlex ID: W1562463698 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3336675
@@ Property / cites work: Q3336675 / rank @@
+Normal rank
@@ Property / cites work @@
+“Sometimes” and “not never” revisited
@@ Property / cites work: “Sometimes” and “not never” revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q3768883
@@ Property / cites work: Q3768883 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542592
@@ Property / cites work: Q4542592 / rank @@
+Normal rank
@@ Property / cites work @@
+An automata-theoretic approach to branching-time model checking
+Normal rank
@@ Property / cites work @@
+A hierarchy of temporal logics with past
@@ Property / cites work: A hierarchy of temporal logics with past / rank @@
+Normal rank
@@ Property / cites work @@
+Specification in CTL + past for verification in CTL.
+Normal rank
@@ Property / cites work @@
+Alternating automata on infinite trees
@@ Property / cites work: Alternating automata on infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4219045
@@ Property / cites work: Q4219045 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about infinite computations
@@ Property / cites work: Reasoning about infinite computations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501666
@@ Property / cites work: Q4501666 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite games on finitely coloured graphs with applications to automata on infinite trees
+Normal rank