Efficient flattening algorithm for hierarchical and dynamic structure discrete event models

DOI10.1145/2875356MaRDI QIDQ5270684zbMATH OpenOpenAlexFDO

Authors Jang Won Bae, Sang Won Bae, Il-Chul Moon, T. G. Kim

Publication date 30 June 2017

Published in ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2875356

zbMATH Keywords

hierarchical modelDEVSdynamic structure modelflattening algorithmgraph-based acceleration

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20)

Recommendations

• scientific article; zbMATH DE number 1262883
• Extending the DEVS formalism for massively parallel simulation
• scientific article; zbMATH DE number 1664930
• On constructing optimistic simulation algorithms for the discrete event system specification
• An extended event graph-based modelling method for parallel and distributed discrete-event simulation

Cites work

• scientific article; zbMATH DE number 1664931 (Why is no real title available?)
• scientific article; zbMATH DE number 1865707 (Why is no real title available?)
• A Unifying View of Hybrid Simulation/Analytic Models and Modeling
• THEORY OF QUANTIZED SYSTEMS: DEVS SIMULATION OF PERCEIVING AGENTS

Cited in

(2)

• On constructing optimistic simulation algorithms for the discrete event system specification
• multiPDEVS: a parallel multicomponent system specification formalism

This page was built for publication: Efficient flattening algorithm for hierarchical and dynamic structure discrete event models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270684)