Observing processes as Discrete Event Systems (DESs) allows for the construction of formal models that assist analysis, control, optimization, correction, etc. Process Mining (PM) can be used to discover DES models from event logs. To support DES control, such discovered models must accurately capture the reachable state space and the patterns formed by event transitions. The diversity and complexity of the possible paths during PM introduce a trade-off between generalizing a model and preserving non-generalizable details that may be helpful, from the control perspective. This paper proposes a method to discover automata models particularly tailored for DES control. Based on premises that fit many of the systems discussed, our method is able to identify cycles that represent different complete tasks performed by the system. Furthermore, by formalizing the notions of fixed and variable repetition structures, we show how to capture recurring patterns in event logs and use them to guide the construction of models that balance precision and generalization. A comparison between the proposed approach and other state-of-the-art approaches usually employed in PM is also presented. It evidences the current gaps in the state-of-the-art and how our method addresses them. Case studies are used to illustrate our results.

The Traveling Salesman Problem with Draft Limits is a combinatorial optimization problem that consists in calculating routes to be taken by cargo ships without violating draft limits restrictions, so reducing transportation costs. Finding the best route solution, using exact computation, is a problem whose complexity grows exponentially with the number of routes and, therefore, is unfeasible for practical cases. Approximations to the best solution, computed using heuristis and metaheuristics, appear as promising and feasible alternatives to address this problem with reasonable accuracy. This paper exploits two metaheuristics, Genetic and Memetic Algorithms, under the perspective of Evolutionary Algorithms, to address the problem at hand. After they are implemented and applied over a route planning map, their effectiveness are compared against each other and also against the literature. Results suggest that the method based on Memetic Algorithm is slightly better (5.28% average error) in comparison with the Genetic-based approach (12.96%), which is shown to be competitive with respect to the literature.