Computational Complexity and Scalability Analysis of PROSA and delegate MAS*

This paper discusses the results of the computational complexity analysis with respect to time, which was performed on the Holonic Manufacturing Execution System (HMES) following the Product-Resource-Order-Staff Architecture (PROSA) and delegate Multi-Agent System (D-MAS). A practical approach was used instead of a theoretical or formal analysis. The analysis shows a polynomial relationship between the time complexity and number of resources and orders in the system and highlights where optimisations could improve the current implementation. Scalability experiments in the domain of multi-robot navigation, with respect to number of robots and environment size, shows this complexity is an upper bound.