The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841): Difference between revisions

@@ 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 @@
+Trace nets and process automata
@@ Property / cites work: Trace nets and process automata / rank @@
+Normal rank
@@ Property / cites work @@
+Step semantics of Boolean nets
@@ Property / cites work: Step semantics of Boolean nets / rank @@
+Normal rank
@@ Property / cites work @@
+Contextual nets
@@ Property / cites work: Contextual nets / rank @@
+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 @@
+Q4247285
@@ Property / cites work: Q4247285 / rank @@
+Normal rank
@@ Property / cites work @@
+Flip-flop nets
@@ Property / cites work: Flip-flop nets / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness Results for the Synthesis of b-bounded Petri Nets
+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