Effective and Efficient Modeling and Simulation with DEVS Variants
Adelinde M. Uhrmacher, Jan Himmelspach, Roland Ewald
Abstract
Adelinde M. Uhrmacher, Jan Himmelspach, Roland Ewald
Abstract
The modular design of Discrete Event System Specification (DEVS) models—each communicates with its environment via input and output ports—allows the construction of complex models by composition. The efficient modeling with DEVS, based on certain formalisms or on model composition, is one important aspect of using DEVS in practice. The chapter discusses some variants of DEVS and thereby focus on formalisms for variable structure models. The abstract sequential algorithm is pretty close to the abstract threaded simulator. There is still an explicit coordinator, respectively, an explicit simulator per model entity. The flat sequential simulator virtually flattens a hierarchical DEVS model, so that it can be computed with a single simulation algorithm in a very efficient manner. Distributed simulation requires partitioning and load balancing techniques to complement the basic algorithms. The DynPDEVS defines inputs, outputs, and states as structured sets.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The modular design of Discrete Event System Specification (DEVS) models—each communicates with its environment via input and output ports—allows the construction of complex models by composition. The efficient modeling with DEVS, based on certain formalisms or on model composition, is one important aspect of using DEVS in practice. The chapter discusses some variants of DEVS and thereby focus on formalisms for variable structure models. The abstract sequential algorithm is pretty close to the abstract threaded simulator. There is still an explicit coordinator, respectively, an explicit simulator per model entity. The flat sequential simulator virtually flattens a hierarchical DEVS model, so that it can be computed with a single simulation algorithm in a very efficient manner. Distributed simulation requires partitioning and load balancing techniques to complement the basic algorithms. The DynPDEVS defines inputs, outputs, and states as structured sets.
Key concepts: DEVS, Computer science, Modeling and simulation, Simulation