Efficient algorithms for three reachability problems in safe Petri nets (Q2117182): Difference between revisions

@@ Property / describes a project that uses @@
+caesar.bdd
@@ Property / describes a project that uses: caesar.bdd / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+NUPN_INFO
@@ Property / describes a project that uses: NUPN_INFO / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CAESAR
@@ Property / describes a project that uses: CAESAR / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3170262536
@@ Property / OpenAlex ID: W3170262536 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account
+Normal rank
@@ Property / cites work @@
+Complexity results for 1-safe nets
@@ Property / cites work: Complexity results for 1-safe nets / rank @@
+Normal rank
@@ Property / cites work @@
+Free Choice Petri Nets
@@ Property / cites work: Free Choice Petri Nets / rank @@
+Normal rank
@@ Property / cites work @@
+Nested-unit Petri nets
@@ Property / cites work: Nested-unit Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+State space reduction for process algebra specifications
+Normal rank
@@ Property / cites work @@
+Nets, sequential components and concurrency relations
+Normal rank