Calculation of system complexity based on the connections: Methodology and applications
This paper proposes a methodology based on system connections to calculate its complexity. There are proposed two study cases: the dining Chinese philosophers problem and the distribution center. Both studies are modeled using the theory of discrete event systems and simulated in different contexts...
Saved in:
Published in | 2016 IEEE 16th International Conference on Environment and Electrical Engineering (EEEIC) pp. 1 - 6 |
---|---|
Main Authors | , , , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.06.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper proposes a methodology based on system connections to calculate its complexity. There are proposed two study cases: the dining Chinese philosophers problem and the distribution center. Both studies are modeled using the theory of discrete event systems and simulated in different contexts in order to measure their complexities. The obtained results present i) the static complexity as a limiting factor for the dynamic complexity and ii) the lowest cost in terms of complexity for each unit of measure of the system performance. The associated complexity and performance measures aggregate knowledge about the system. |
---|---|
DOI: | 10.1109/EEEIC.2016.7555582 |