A new class of a high-level petri net for modelling logical OR efficiently: coloured AND/OR Petri nets (CARPN)

摘要

In Petri nets (PN), because all the input places of a transition are connected to each other with Logical AND to enable the transition, Logical OR connections amongst its input places cannot be modelled. In the case there are k alternatives (Logical Ors) to perform a task, e.g.. assembly of a product, k transitions are required for modelling these k alternatives in PN model, each transition repre- senting each alternative.