TY - JOUR
T1 - Developing Spectral Structural Complexity Metrics
AU - Pugliese, Antonio
AU - Nilchiani, Roshanak
N1 - Publisher Copyright:
© 2007-2012 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - There are various approaches to measure the complexity of engineered systems. The structural approach to the measurement of system complexity is only one of the possible routes that are currently under consideration. This approach considers the complexity of the internal structure of the system and the organization of its components, as a snapshot frozen in time.The most common approach to the definition of structural complexity metrics is through the concepts of entropy, algorithmic information content, and logical depth. Another approach looks at the set of the eigenvalues-the spectrum-of a graph representation of the system of interest. The most popular spectral structural complexity metrics are graph energy and natural connectivity. The authors in this article present a set of metrics that are created based on the existing metrics. The metrics assume that the graphs representing the system of interest are weighted with values representing the complexity of components and interfaces. The metrics are then explored through two sets of random graphs, representing the architecture of an engineered system.
AB - There are various approaches to measure the complexity of engineered systems. The structural approach to the measurement of system complexity is only one of the possible routes that are currently under consideration. This approach considers the complexity of the internal structure of the system and the organization of its components, as a snapshot frozen in time.The most common approach to the definition of structural complexity metrics is through the concepts of entropy, algorithmic information content, and logical depth. Another approach looks at the set of the eigenvalues-the spectrum-of a graph representation of the system of interest. The most popular spectral structural complexity metrics are graph energy and natural connectivity. The authors in this article present a set of metrics that are created based on the existing metrics. The metrics assume that the graphs representing the system of interest are weighted with values representing the complexity of components and interfaces. The metrics are then explored through two sets of random graphs, representing the architecture of an engineered system.
KW - Complexity metrics
KW - complexity theory
KW - structural complexity
KW - system architecture
KW - systems engineering
UR - http://www.scopus.com/inward/record.url?scp=85075729499&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85075729499&partnerID=8YFLogxK
U2 - 10.1109/JSYST.2019.2912368
DO - 10.1109/JSYST.2019.2912368
M3 - Article
AN - SCOPUS:85075729499
SN - 1932-8184
VL - 13
SP - 3619
EP - 3626
JO - IEEE Systems Journal
JF - IEEE Systems Journal
IS - 4
M1 - 8846869
ER -