PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS (Q3395130): Difference between revisions

@@ Property / cites work @@
+Decidable problems on the strong connectivity of Petri net reachability sets
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+The decidability of persistence for vector addition systems
+Normal rank
@@ Property / cites work @@
+On structural conditions for weak persistency and semilinearity of Petri nets
+Normal rank
@@ Property / cites work @@
+On the reachability problem for 5-dimensional vector addition systems
+Normal rank
@@ Property / cites work @@
+Normal and sinkless Petri nets
@@ Property / cites work: Normal and sinkless Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Reversal-Bounded Multicounter Machines and Their Decision Problems
+Normal rank
@@ Property / cites work @@
+Properties of Conflict-Free and Persistent Petri Nets
+Normal rank
@@ Property / cites work @@
+Persistence of vector replacement systems is decidable
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+On weak persistency of Petri nets
@@ Property / cites work: On weak persistency of Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Normal Petri nets
@@ Property / cites work: Normal Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Recent advances in formal languages and applications.
+Normal rank