THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic verification of finite-state concurrent systems using temporal logic specifications
+Normal rank
@@ Property / cites work @@
+Q4385542
@@ Property / cites work: Q4385542 / rank @@
+Normal rank
@@ Property / cites work @@
+Propositional dynamic logic of regular programs
@@ Property / cites work: Propositional dynamic logic of regular programs / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+About the expressive power of CTL combinators
@@ Property / cites work: About the expressive power of CTL combinators / rank @@
+Normal rank
@@ Property / cites work @@
+Past is for free: On the complexity of verifying linear temporal properties with past
+Normal rank
@@ Property / cites work @@
+Q4354427
@@ Property / cites work: Q4354427 / rank @@
+Normal rank
@@ Property / cites work @@
+Gap-languages and log-time complexity classes
@@ Property / cites work: Gap-languages and log-time complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of propositional linear temporal logics
+Normal rank