SYSTEM CONTROL FOR A CAKE MACHINE

Abstract

This paper studies the application of Petri Nets and Finite Automata for the optimization of systems in a cake machine. Petri Nets are employed to model and visualize the dynamic interactions between the various components of the system, providing a robust and detailed graphical representation of workflows and processes. On the other hand, Finite Automata are used to capture and represent the discrete states and transitions of the system, allowing an accurate and rigorous analysis of expected and possible behaviors. The integration of these two approaches provides a comprehensive methodology for the operational optimization of the cake machine. Petri Nets allow you to identify and analyze critical points and bottlenecks in the system, while Finite Automata facilitate the clear definition of states and the management of transitions between them. This combination enables a detailed analysis of systemic interactions, allowing the implementation of structured and efficient improvements that result in optimized performance. In addition, the joint application of these techniques provides a flexible and adaptable platform for the simulation and validation of different operational scenarios, ensuring that the implemented changes are effective and sustainable. In summary, this paper demonstrates how the junction between Petri Nets and Finite Automata can be exploited to achieve significant optimization in the operation of cake machines, highlighting the relevance and applicability of these tools in the engineering of complex systems.