A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343): Difference between revisions

@@ Property / OpenAlex ID @@
+W3112000701
@@ Property / OpenAlex ID: W3112000701 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
+Normal rank
@@ Property / cites work @@
+Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets
+Normal rank
@@ Property / cites work @@
+What makes Petri nets harder to verify: stack or data?
+Normal rank
@@ Property / cites work @@
+Hyper-Ackermannian bounds for pushdown vector addition systems
+Normal rank
@@ Property / cites work @@
+On boundedness problems for pushdown vector addition systems
+Normal rank
@@ Property / cites work @@
+The reachability problem for Petri nets is not elementary
+Normal rank
@@ Property / cites work @@
+The complexity of membership problems for circuits over sets of integers
+Normal rank