Equivalent Transformation of Nonlinear Constraints to Linear Constraints in Petri Nets

Algorithm 1

Computation of the set of admissible markings and the set of BFMs.

Input: A Bounded Petri net and a constraint

Output: The set of admissible markings and the set of BFMs

(1) . / denotes the set of markings whose successors are not computed. /

(2) while do

    , remove from , that is, .

    for each transition enabled at do

   .

   if and then

     and .

   elseif and

     and .

   endif

  endwhile

(3) Output and .

(4) End.