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
相关论文
共 50 条
  • [21] Simulation Study on the Application of Traffic-flow Complexity Measure in Traffic Control
    Liu, Fengtao
    Tang, Yong
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 13057 - +
  • [22] A statistical measure of complexity
    LopezRuiz, R
    Mancini, HL
    Calbet, X
    PHYSICS LETTERS A, 1995, 209 (5-6) : 321 - 326
  • [23] A MEASURE OF PROGRAM COMPLEXITY
    STETTER, F
    COMPUTER LANGUAGES, 1984, 9 (3-4): : 203 - 208
  • [24] AN ALGEBRAIC MEASURE OF COMPLEXITY
    URIAS, J
    PHYSICA D, 1991, 47 (03): : 498 - 508
  • [25] Simple measure for complexity
    Shiner, JS
    Davison, M
    Landsberg, PT
    PHYSICAL REVIEW E, 1999, 59 (02): : 1459 - 1464
  • [26] Simple measure for complexity
    Physiologisches Institute, Universität Bern, Bühlp
    atz 5, CH-3012 Bern, Switzerland
    不详
    不详
    Phys Rev E., 2 PART A (1459-1464):
  • [27] Sensing as a Complexity Measure
    Almagor, Shaull
    Kuperberg, Denis
    Kupferman, Orna
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2019, 30 (6-7) : 831 - 873
  • [28] Sensing as a Complexity Measure
    Almagor, Shaull
    Kuperberg, Denis
    Kupferman, Orna
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 3 - 15
  • [29] MEASURE OF COMPLEXITY OF A SUBSYSTEM
    DASTYCH, P
    CYBERNETICA, 1973, 16 (01): : 58 - 72
  • [30] Software quality classification model based on McCabe's complexity measure
    Takahashi, R
    JOURNAL OF SYSTEMS AND SOFTWARE, 1997, 38 (01) : 61 - 69