Hardness Results for the Synthesis of b-bounded Petri Nets (Q6144211): Difference between revisions

@@ Property / cites work @@
+Process Mining
@@ Property / cites work: Process Mining / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for the synthesis of bounded nets
+Normal rank
@@ Property / cites work @@
+The synthesis problem for elementary net systems is NP-complete
+Normal rank
@@ Property / cites work @@
+Petri net synthesis
@@ Property / cites work: Petri net synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Distributing finite automata through Petri net synthesis
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some complexity results on transition systems and elementary net systems
+Normal rank
@@ Property / cites work @@
+A survey of Petri net methods for controlled discrete event systems
+Normal rank
@@ Property / cites work @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / rank @@
+Normal rank
@@ Property / cites work @@
+k-Bounded Petri Net Synthesis from Modal Transition Systems.
+Normal rank
@@ Property / cites work @@
+Flip-flop nets
@@ Property / cites work: Flip-flop nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009430
@@ Property / cites work: Q5009430 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of synthesis for 43 Boolean Petri net types
+Normal rank
@@ Property / cites work @@
+Elementary net synthesis remains NP-complete even for extremely simple inputs
+Normal rank