Optimal Trajectory Generation for Petri nets

  Szilvia Gyapay - András Pataricza

Abstract:

 Recently, the increasing complexity of IT systems requires the early verification and validation of the system design in order to avoid the costly redesign. Furthermore, the efficiency of system operation can be improved by solving system optimization problems (like resource allocation and scheduling problems). Such combined optimization and validation, verification problems can be typically expressed as reachability problems with quantitative or qualitative measurements. The current paper proposes a solution to compute the optimal trajectories for Petri net-based reachability problems with cost parameters. This is an improved variant of the basic integrated verification and optimization method introduced in [?] combining the efficiency of Process Network Synthesis optimization algorithms with the modeling power of Petri nets.

Footnotes

 This work was supported by project OTKA T038027.

 Budapest University of Technology and Economics, Department of Measurement and Information Systems, Magyar tudósok körútja 2., H-1117, Budapest, Hungary. Phone: +36-1-463-3579, +36-1-463-3595 Fax: +36 1 463-2667 E-mail:{gyapay,pataric}@mit.bme.hu