Business Process Modeling and Analysis Based on Queue Logical Petri Nets

In the present modeling tools, there is no proper model to describe the fairness of resource scheduling for sharing systems. In order to solve this problem well, we propose a new sharing system and Queue Logical Petri nets. In this paper, a complete process of entering and leaving a garage is modeled by a Queue Logical Petri nets. Based on random arrival and exponential arrival, the average waiting time of vehicles, the average stay time in the queue and the average number of waiting vehicles in the queue are analyzed. According to reachable sequence of Queue Logical Petri net, the Invariant, the utilization of garage and the number of waiting vehicles are analyzed. And the validity of the sharing system with queue is proved by compared with other methods in the experiment.