Abstract
The modeling formalism DEVS comes along with the abstract simulator - a description how to execute DEVS models. This scheme (formalism and separate simulator description) has been used for all DEVS like formalisms. However, a direct implementation of the abstarct simulator is not necessarily the most efficient way to compute a model. Here we introduce a family of simulation algorithms which sequentially compute (parts of) a PDEVS model tree and evaluate their performance. For the later James II provides a coherent test setting.
Cite
CITATION STYLE
Himmelspach, J., & Uhrmacher, A. M. (2006). Sequential processing of PDEVS models. In International Mediterranean Modelling Multiconference, I3M (pp. 239–244).
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.