Metric for Calculation of System Complexity based on its Connections

João Ricardo Braga de Paiva, Viviane Margarida Gomes, Bernardo Araújo Rodrigues, Lais Fernanda Araújo Silva, Bruno Cesar Maioli Aniceto, Geovanne Pereira Furriel, Wesley Pacheco Calixto

Abstract


This paper proposes a methodology based on system connections to calculate its complexity. Two study cases are proposed: the dining Chinese philosophers’ problem and the distribution center. Both studies are modeled using the theory of Discrete Event Systems and simulations in different contexts were performed in order to measure their complexities. The obtained results present i) the static complexity as a limiting factor for the dynamic complexity, ii) the lowest cost in terms of complexity for each unit of measure of the system performance and iii) the output sensitivity to the input parameters. The associated complexity and performance measures aggregate knowledge about the system.

Keywords


complexity; connections; discrete events systems; modeling; simulation

Full Text:

PDF

References


E. Rechtin and M. W. Maier, The art of systems architecting. CRC Press, 2010.

T. Per Bak and K. Wiesenfeld, “Self-organized criticality: and explanation

of 1/f noise,” Phys. Rev. Let, vol. 59, pp. 381–384, 1987.

J. H. Holland, Complexity: A very short introduction. Oxford University Press, 2014.

H. A. Simon, “The architecture of complexity,” Proceedings of the American Philosophical Society, vol. 106, no. 6, pp. 467–482, 1962.

S. Lloyd, “Measures of complexity: a nonexhaustive list,” IEEE Control Systems Magazine, vol. 21, no. 4, pp. 7–8, 2001.

L. Santos, C. Silva, J. Paiva, V. Gomes, S. Oliveira, A. Alves, and W. Calixto, “A methodology for calculation of complexity in systems: Case study,” in IEEE Congreso Chileno de Ingeniería Eléctrica, Electrônica, Tecnologías de la Informacíon y Comunicaciones, pp. 213–218, 2015.

C. G. Cassandras, S. Lafortune. Introduction to discrete event systems. Secaucus, NJ: Springer Science & Business Media, 2008.

A. Saltelli, et al. Global Sensitivity Analysis. England: John Wiley & Sons, Ltd, 2008.

E. W. Dijkstra, “Hierarchical ordering of sequential processes,” Acta Informatica, vol. 1, no. 2, pp. 115–138, 1971.

L. Chwif and A. C. Medina, Modeling and simulation of discrete events (in portuguese). Campus-Elsevier, 4 ed., 2014.

D. W. Repperger, R. G. Roberts, and C. G. Koepke, “Quantitative measurements of system complexity,” US Patent 8,244,503 B1, Aug. 8, 2012.

C. E. Shannon, “A mathematical theory of communication” The Bell System Technical Journal, vol. 27, pp. 379–423, 623–656, 1948.

M. J. R. Lemes, “Complexity, coupling and criticality (C2A) as risk factors in system design (in portuguese),” PhD thesis, University of São Paulo, 2012.

C. Gershenson and N. Fernández, “Complexity and information: Measuring emergence, self-organization, and homeostasis at multiple scales,” Complexity, vol. 18, no. 2, pp. 29–44, 2012.

C. Gershenson, “Harnessing the complexity of education with information technology,” Complexity, vol. 20, no. 5, pp. 13–16, 2015.

C. E. Maldonado, G. Cruz, and A. Nelson, “Biological hypercomputation: A new research problem in complexity theory,” Complexity, vol. 20, no. 4, pp. 8–18, 2015.

A. S. Tanenbaum and H. Bos, Modern operating systems. Prentice Hall Press, 2014.




DOI: http://dx.doi.org/10.22149/teee.v2i1.80

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 João Ricardo Braga de Paiva, Viviane Margarida Gomes, Bernardo Araújo Rodrigues, Lais Fernanda Araújo Silva, Bruno Cesar Maioli Aniceto, Geovanne Pereira Furriel, Wesley Pacheco Calixto

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

SSL Certificate