| Abstract: | Logic Petri nets (LPNs) can describe and analyse the batch processing function and passing value indeterminacy in cooperative systems, and alleviate the state space explosion problem. However, the indeterminate data of logical output transitions cannot be described explicitly in LPNs. Therefore, Coloured Logic Petri nets (CLPNs) are defined in this paper. It can determine the indeterminate data of logic output transitions in LPNs, i.e., the indeterminate data can be represented definitely in CLPNs. A vector matching method is proposed to judge the enabling transitions and analyse CLPNs. From the marking equation and the proposed reachable tree generation algorithm of CLPNs, a reachable tree can be built, and reachable markings are calculated. The advantage of CLPNs can be shown based on the number of leaf nodes of the reachability tree, and CLPNs can solve the indeterminate data of logical output transitions. Finally, an example shows that CLPNs can further reduce the dimensionality of reachable markings. |
