Response time approximation for the performance analysis of manufacturing systems modeled with stochastic marked graphs

Embedded in the divide-and-conquer paradigm, the authors introduce a technique for iterative analysis of stochastic marked graphs. The basic idea is to split the original net system into two parts. It is demonstrated on a model which represents the implementation of a Kanban manufacturing system. From the stochastic perspective, the throughput computation on partial subnets uses a response time approximation. Experimental results on several examples were usually pessimistic with respect to the throughput with an error of less than 3-5%. The computational effort was usually reduced by more than one or two orders of magnitude