Equivalent Transformation of Nonlinear Constraints to Linear Constraints in Petri Nets

Abstract EN

This paper focuses on the enforcement of nonlinear constraints in Petri nets.

An integer linear programming model is formulated to transform a nonlinear constraint to a minimal number of conjunctive linear constraints that have the same admissible marking space as the nonlinear one does in Petri nets.

The obtained linear constraints can be easily enforced to be satisfied by a set of control places with a place invariant based method.

The control places make up a supervisor that can enforce the given nonlinear constraint.

For a case that the admissible marking space decided by a nonlinear constraint is nonconvex, another integer linear programming model is developed to obtain a minimal number of constraints whose disjunctions are equivalent to the nonlinear constraint with respect to the reachable markings.

Finally, a number of examples are provided to demonstrate the proposed approach.