In this paper, a structural methodology for bottom-up synthesis of Petri Nets for 1C Flexible Manufacturing Systems is presented for the first time. With the help of a guarantying policy of liveness , a live, bounded and reversible final model can be obtained by merging different submodels through what is called autonomy subnet sharing among them. To demonstrate the application of the method, a flexible manufacturing system of integrated circuits is modeled and analyzed using the proposed theory. Furthermore, combined the execution rule of Petri Nets and the search algorithms of tree, an innovative scheduling method is proposed by applying a heuristic search to the state space of Petri Nets. Specially, by introducing heuristic function, depth-first and width-first is mixed in the search course; thereby a feasible solution can be generated in a reasonable amount of time.
|