Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)
Melbourne, Victoria, Australia
Dec. 2, 1991 to Dec. 5, 1991
C.M. Woodside , Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
Yao Li , Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
Performance analysis of Petri net models is limited by state explosion in the underlying Markovian model. To overcome this problem, an iterative approximate technique is obtained, using a number of auxiliary models, each of much lower state complexity. It is demonstrated on a substantial model which represents a parallel implementation of two layers of protocols for data communications. The model represents ten separate software tasks and their interactions via rendezvous, and is based on a testbed implementation in the laboratory. Submodels can be constructed in various ways, and this is illustrated with four different decompositions. Their state space complexity, solution time and solution accuracy are evaluated.<
computational complexity, computer communications software, Petri nets, protocols
C. Woodside and Yao Li, "Performance Petri net analysis of communications protocol software by delay-equivalent aggregation," Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM), Melbourne, Victoria, Australia, , pp. 64-73.