Colored Petri net control of OR-logic

Usually, the maximally permissive control of Petri nets with an OR-logic constraint is difficult to implement. In this paper, OR-logic is easily enforced using a colored Petri net. A colored Petri net place, named colored monitor place, is designed to monitor the states of constraints. A so-called guard function of colored Petri nets that maps certain transitions into a Boolean expression is suitably defined on the colored sets. The maximally permissive control is then obtained via the guard function. In addition, a constraint transformation method for marked graphs with uncontrollable transitions is proposed.