Simulation languages supporting hierarchical submodel structures, face sorting problems not present in monolithic CSSL67 models. These problems , result from algebraic relationships between submodels leading to information loops in the model code.
This paper proposes a global solution, based on the segmentation of the submodels through graph analysis, and its promising application to sorting problems.
CitationGuasch, A.; Hubert, R. Precompiled submodels: A general sorting procedure. A: European Simulation Congress. "ESC 86. 2nd European Simulation Congress". Antwerp: 1986, p. 172-178.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org