The decidability of persistence for vector addition systems (Q1144929): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(80)90026-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2162339458
@@ Property / OpenAlex ID: W2162339458 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidable problems on the strong connectivity of Petri net reachability sets
+Normal rank
@@ Property / cites work @@
+A decidability theorem for a class of vector-addition systems
+Normal rank
@@ Property / cites work @@
+Q3893319
@@ Property / cites work: Q3893319 / rank @@
+Normal rank
@@ Property / cites work @@
+Synchronisationsgraphen
@@ Property / cites work: Synchronisationsgraphen / rank @@
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel program schemata
@@ Property / cites work: Parallel program schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of Conflict-Free and Persistent Petri Nets
+Normal rank
@@ Property / cites work @@
+Q3939247
@@ Property / cites work: Q3939247 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853141
@@ Property / cites work: Q3853141 / rank @@
+Normal rank