Coverability in 2-VASS with one unary counter is in NP (Q6091190): Difference between revisions

@@ Property / OpenAlex ID @@
+W4366504015
@@ Property / OpenAlex ID: W4366504015 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5089314
@@ Property / cites work: Q5089314 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5089305
@@ Property / cites work: Q5089305 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The Reachability Problem for Two-Dimensional Vector Addition Systems with States
+Normal rank
@@ Property / cites work @@
+Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
+Normal rank
@@ Property / cites work @@
+Directed reachability for infinite-state systems
@@ Property / cites work: Directed reachability for infinite-state systems / rank @@
+Normal rank
@@ Property / cites work @@
+Two-variable logic on data words
@@ Property / cites work: Two-variable logic on data words / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218930
@@ Property / cites work: Q4218930 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5089315
@@ Property / cites work: Q5089315 / rank @@
+Normal rank
@@ Property / cites work @@
+The reachability problem for Petri nets is not elementary
+Normal rank
@@ Property / cites work @@
+Q5092425
@@ Property / cites work: Q5092425 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the coverability problem in acyclic pushdown VAS
+Normal rank
@@ Property / cites work @@
+Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
+Normal rank
@@ Property / cites work @@
+An SMT-Based Approach to Coverability Analysis
@@ Property / cites work: An SMT-Based Approach to Coverability Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in Two-Clock Timed Automata Is PSPACE-Complete
+Normal rank
@@ Property / cites work @@
+Q5090970
@@ Property / cites work: Q5090970 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
+Normal rank
@@ Property / cites work @@
+A Perfect Model for Bounded Verification
@@ Property / cites work: A Perfect Model for Bounded Verification / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in Succinct and Parametric One-Counter Automata
+Normal rank
@@ Property / cites work @@
+On the reachability problem for 5-dimensional vector addition systems
+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 @@
+Q4601852
@@ Property / cites work: Q4601852 / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2004 - Concurrency Theory
@@ Property / cites work: CONCUR 2004 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5089304
@@ Property / cites work: Q5089304 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+Reachability in Petri Nets with Inhibitor Arcs
@@ Property / cites work: Reachability in Petri Nets with Inhibitor Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic one-counter automata
@@ Property / cites work: Deterministic one-counter automata / rank @@
+Normal rank