Queueing analysis, in general., has the intrinsic problem of large state space dimension and complex computation. In fact, the petri net is a graphical and mathematical model. It has been used for the modeling of various applications, in particular, m...
Queueing analysis, in general., has the intrinsic problem of large state space dimension and complex computation. In fact, the petri net is a graphical and mathematical model. It has been used for the modeling of various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a technique for modeling and analyzing queueing model using stochastic activity networks (SANs). And then some examples are showed for the verification of the technique presented in this paper.