Authors: Miguel Mujica, Miquel Angel Piera, Mercedes Narciso
This paper presents the highlights of a two-stepalgorithm based on the reachability tree for optimizingindustrial system models coded with the Coloured PetriNet formalism. The first step of the algorithm consistsin generating all the possible states that can be reachedby the system, and the second step of the algorithmfocuses on updating the time stamp values of the mostpromising state subspaces of the system. Some testswith benchmarking problems have been made toevaluate the efficiency of the second part of thealgorithm, and the results obtained are analyzed in orderto identify the algorithm processes that needimprovements. Based on the results, an heuristic hasbeen developed to improve the performance with abetter choice of states to be expanded during thegeneration of the reachability tree.