\textit{Once} and \textit{for all} (Q439961): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2011.08.006
@@ Property / DOI: 10.1016/j.jcss.2011.08.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3246315
@@ Property / cites work: Q3246315 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3711745
@@ Property / cites work: Q3711745 / rank @@
+Normal rank
@@ Property / cites work @@
+Specification in CTL + past for verification in CTL.
+Normal rank
@@ Property / cites work @@
+Q3740223
@@ Property / cites work: Q3740223 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata-theoretic techniques for modal logics of programs
+Normal rank
@@ Property / cites work @@
+Q3768883
@@ Property / cites work: Q3768883 / rank @@
+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 @@
+Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
+Normal rank
@@ Property / cites work @@
+Q3906386
@@ Property / cites work: Q3906386 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic verification of finite-state concurrent systems using temporal logic specifications
+Normal rank
@@ Property / cites work @@
+Decision procedures and expressiveness in the temporal logic of branching time
+Normal rank
@@ Property / cites work @@
+Deciding full branching time logic
@@ Property / cites work: Deciding full branching time logic / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of CTL* + Linear Past
@@ Property / cites work: The Complexity of CTL* + Linear Past / rank @@
+Normal rank
@@ Property / cites work @@
+An automata-theoretic approach to branching-time model checking
+Normal rank
@@ Property / cites work @@
+Temporal logic in specification. Altrincham, UK, April 8-10, 1987. Proceedings
+Normal rank
@@ Property / cites work @@
+“Sometimes” and “not never” revisited
@@ Property / cites work: “Sometimes” and “not never” revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal logic can be more expressive
@@ Property / cites work: Temporal logic can be more expressive / rank @@
+Normal rank
@@ Property / cites work @@
+Q4219045
@@ Property / cites work: Q4219045 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating automata on infinite trees
@@ Property / cites work: Alternating automata on infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501666
@@ Property / cites work: Q4501666 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about infinite computations
@@ Property / cites work: Reasoning about infinite computations / rank @@
+Normal rank
@@ Property / cites work @@
+Theories of automata on \(\omega\)-tapes: a simplified approach
+Normal rank
@@ Property / cites work @@
+The complexity of propositional linear temporal logics
+Normal rank
@@ Property / cites work @@
+Propositional dynamic logic of regular programs
@@ Property / cites work: Propositional dynamic logic of regular programs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2011.08.006
@@ Property / DOI: 10.1016/J.JCSS.2011.08.006 / rank @@
+Normal rank