A decomposition theorem for finite persistent transition systems (Q1015394): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00236-009-0095-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1977456141
@@ Property / OpenAlex ID: W1977456141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3504339
@@ Property / cites work: Q3504339 / rank @@
+Normal rank
@@ Property / cites work @@
+Separability in Conflict-Free Petri Nets
@@ Property / cites work: Separability in Conflict-Free Petri Nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636912
@@ Property / cites work: Q5636912 / rank @@
+Normal rank
@@ Property / cites work @@
+Marked directed graphs
@@ Property / cites work: Marked directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
+Normal rank
@@ Property / cites work @@
+Free Choice Petri Nets
@@ Property / cites work: Free Choice Petri Nets / rank @@
+Normal rank
@@ Property / cites work @@
+The decidability of persistence for vector addition systems
+Normal rank
@@ Property / cites work @@
+Q4055201
@@ Property / cites work: Q4055201 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of Conflict-Free and Persistent Petri Nets
+Normal rank
@@ Property / cites work @@
+On weak persistency of Petri nets
@@ Property / cites work: On weak persistency of Petri nets / rank @@
+Normal rank