A combination of Petri nets and process network synthesis

Resource allocation and scheduling optimization problems are core problems in the field of IT systems. However, such problems frequently underlie several additional constraints. The formalization of a real life problem requires a well-defined mathematical and modeling approach providing an integrated verification and optimization. The current paper proposes such methods adapting Process Network Synthesis algorithms to Petri net reachability problem: combining the efficiency of PNS optimization algorithms with the modeling power of Petri nets. They provide powerful techniques to compute optimal trajectories for the reachability analysis of the modeled system.