Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2005.03.002
@@ Property / DOI: 10.1016/j.ipl.2005.03.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2070402943
@@ Property / OpenAlex ID: W2070402943 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of Conflict-Free and Persistent Petri Nets
+Normal rank
@@ Property / cites work @@
+The decidability of persistence for vector addition systems
+Normal rank
@@ Property / cites work @@
+Persistence of vector replacement systems is decidable
+Normal rank
@@ Property / cites work @@
+Q4202931
@@ Property / cites work: Q4202931 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for the synthesis of bounded nets
+Normal rank
@@ Property / cites work @@
+Concurrent transition systems
@@ Property / cites work: Concurrent transition systems / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2005.03.002
@@ Property / DOI: 10.1016/J.IPL.2005.03.002 / rank @@
+Normal rank