Toward a Simulation Model Complexity Measure

被引:4
作者
Thompson, J. Scott [1 ]
Hodson, Douglas D. [2 ]
Grimaila, Michael R. [3 ]
Hanlon, Nicholas [1 ]
Dill, Richard [2 ]
机构
[1] USAF, Res Lab, Aerosp Syst Directorate, Dayton, OH 45433 USA
[2] Air Force Inst Technol, Dept Elect & Comp Engn, Dayton, OH 45433 USA
[3] Air Force Inst Technol, Dept Syst Engn & Management, Dayton, OH 45433 USA
关键词
simulation model; complexity; Kolmogorov complexity; normalized compression distance; resolution; scope; model families; FORMAL THEORY; HIERARCHY; SCIENCE; GUIDE;
D O I
10.3390/info14040202
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Is it possible to develop a meaningful measure for the complexity of a simulation model? Algorithmic information theory provides concepts that have been applied in other areas of research for the practical measurement of object complexity. This article offers an overview of the complexity from a variety of perspectives and provides a body of knowledge with respect to the complexity of simulation models. The key terms model detail, resolution, and scope are defined. An important concept from algorithmic information theory, Kolmogorov complexity, and an application of this concept, normalized compression distance, are used to indicate the possibility of measuring changes in model detail. Additional research in this area can advance the modeling and simulation body of knowledge toward the practical application of measuring simulation model complexity. Examples show that KC and NCD measurements of simulation models can detect changes in scope and detail.
引用
收藏
页数:15
相关论文
共 54 条
  • [1] [Anonymous], 2016, DESIGN UNEXPECTED
  • [2] [Anonymous], 2019, INTRO KOLMOGOROV COM
  • [3] [Anonymous], 1968, The ghost in the machine
  • [4] rust-code-analysis: A Rust library to analyze and extract maintainability information from source codes
    Ardito, Luca
    Barbato, Luca
    Castelluccio, Marco
    Coppola, Riccardo
    Denizet, Calixte
    Ledru, Sylvestre
    Valsesia, Michele
    [J]. SOFTWAREX, 2020, 12
  • [5] Arora S., 2007, Computational Complexity: A Modern Approach
  • [6] Ashby W.R., 2011, EMERGENCE-COMPLEX OR, V13, P190
  • [7] Balci O., 1988, 1988 Winter Simulation Conference Proceedings (IEEE Cat. No.88CG2659-1), P287, DOI 10.1145/318123.318204
  • [8] Beer S., 1979, HEART ENTERPRISE
  • [9] SOFTWARE ENGINEERING ECONOMICS
    BOEHM, BW
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1984, 10 (01) : 4 - 21
  • [10] SCIENCE AND STATISTICS
    BOX, GEP
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1976, 71 (356) : 791 - 799