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 条
  • [11] CONTROL AND SIMULATION LANGUAGE
    BUXTON, JN
    LASKI, JG
    [J]. COMPUTER JOURNAL, 1962, 5 (03) : 194 - &
  • [12] Campbell G.A., 2021, NEW WAY MEASURING UN
  • [13] Discrete-Event Simulation Model Generation based on Activity Metrics
    Capocchi L.
    Santucci J.F.
    Pawletta T.
    Folkerts H.
    Zeigler B.P.
    [J]. Simulation Modelling Practice and Theory, 2020, 103
  • [14] ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES
    CHAITIN, GJ
    [J]. JOURNAL OF THE ACM, 1966, 13 (04) : 547 - +
  • [15] Clustering by compression
    Cilibrasi, R
    Vitányi, PMB
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) : 1523 - 1545
  • [16] The Google similarity distance
    Cilibrasi, Rudi L.
    Vitanyi, Paul M. B.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (03) : 370 - 383
  • [17] Clive P.D., 2015, P 13 INT C SCI COMP
  • [18] Davis P. K., 1993, Proceedings Fourth Annual Conference. AI, Simulation, and Planning in High Autonomy Systems. Theme: Integrating Virtual Reality and Model-Based Environments, P180, DOI 10.1109/AIHAS.1993.410585
  • [19] DAVIS PK, 1993, 1993 WINTER SIMULATION CONFERENCE PROCEEDINGS, P1003
  • [20] ASHBY LAW OF REQUISITE VARIETY - AN EMPIRICAL-STUDY
    DERAADT, JDR
    [J]. CYBERNETICS AND SYSTEMS, 1987, 18 (06) : 517 - 536