A note on the equivalence of the set covering and process network synthesis problems

In this paper, combining and completing some earlier results presented in this journal, it is proved that the Process Network Synthesis problem (PNS problem for short) is equivalent to the set covering problem

Automaton theory approach for solving modified PNS problems

In this paper a modified version of the Process Network Synthesis (PNS) problem is studied. By using an automaton theoretical approach, a procedure for finding an optimal solution of this modified PNS problem is presented