Research on transition priorities in group based on CPN
Hong Wang1,2,3, Tao Zhang2
1Academy of OPTO-Electronics, Chinese Academy of Sciences, Deng Zhuang Rd. 9, Distinct Haidian, Beijing, China
2Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Deng Zhuang Rd. 9, Distinct Haidian, Beijing, China
3University of Chinese Academy of Sciences, YuquanRd. 19, Shijingshan District, Beijing, China
Transition priorities might be a useful mechanism when modelling using Petri nets. Accordingly, the newest CPN Tools, widely used for modelling and simulating the Coloured Petri net, implements transition priorities. Whereas, the algorithms compute enabling for all transitions in a highest-priority-first order. In the real system, it is usually that there are priorities relationships not for all transitions but only some ones. Based on the above analysis, this paper put all the transitions, having priority relations, into one group and advances relative theoretical definitions of transition priorities in group, such as absolute preset of transition, key place set, key colour set, etc. Furthermore, it proposes new algorithms when the systems have different key place set and key colour set, and construct the model of the interrupt priorities to solve the problem of software model checking for interrupt system.