Array-Aware Matching: Taming the Complexity of Large-Scale Simulation Models

Equation-based modelling is a powerful approach to tame the complexity of large-scale simulation problems. tools automatically translate models into imperative languages. When confronted with nowadays’ problems, however, well assessed model translation techniques exhibit scalability issues that are particularly severe when contain very large arrays. In fact, such can be made compact by enclosing equations looping constructs, but reflecting same compactness translated code nontrivial. this paper, we face issue concentrating on key step equations-to-code translation, equation/variable matching. We first show an efficient (large) arrays needs awareness their presence, defining figure merit measure how much constructs preserved along translation. then said allows define optimal array-aware matching, and as our main result, so stated matching problem NP-complete. As additional propose heuristic algorithm capable performing in polynomial time. The proposed proficiently used translator developers implementation for system simulation.