Complexity Analysis on Flattened PDEVS Simulations

Discrete Event Systems Specification (DEVS) is a well-known formalism to develop models using the discrete event approach. One advantage of DEVS is a clear separation between the modeling and simulation activities. The user only needs to develop models and general algorithms exist in the literature to execute simulations. DEVS was enhanced to handle better simultaneous events in the PDEVS formalism. To execute PDEVS simulations, a well-know and widely accepted algorithm was introduced: the PDEVS simulation protocol. However, since its creation, the protocol has evolved, and several versions have been proposed and implemented. In this work we propose and analytical approach to fully define and analyze this protocol. We divide the protocol into steps and sub-steps and for each of them we present a computer complexity analysis based on two key factors of the protocol's execution: the messages the components interchange and the computations the components execute.