The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525): Difference between revisions

@@ Property / cites work @@
+Q3219122
@@ Property / cites work: Q3219122 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4289279
@@ Property / cites work: Q4289279 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+A structure to decide reachability in Petri nets
@@ Property / cites work: A structure to decide reachability in Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel program schemata
@@ Property / cites work: Parallel program schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387658
@@ Property / cites work: Q5387658 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-variable logic on data trees and XML reasoning
+Normal rank
@@ Property / cites work @@
+Q2920125
@@ Property / cites work: Q2920125 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247290
@@ Property / cites work: Q4247290 / rank @@
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank