Sequential Failure Analysis Using Novel Algorithms in Sequence Determination of Petri Nets Firing

Algorithm 2

Function Filler of the proposed algorithm.

FILLER Algorithm

Input:  Info, level, 𝑇, Internal, External, Status

Ouput: Cons = []_𝑛×𝑛

Cons = Info;

[𝑎 𝑏] = Finder(Info, level);        ∖ ∖𝑎=[]_1×𝑘, 𝑏=[]_1×𝑘

for  𝑖=1→3→Linefinder(Info) + 1

 if Cons{𝑖−2, level}≠0  then

  for  𝑚=1→𝑘

   if  Info {𝑖−2, level}−𝑎{1,𝑚}=0  then

    for  𝑗=1→𝑇

     if Cons{𝑖−1, level}(𝑗)=1  then

      Cons{𝑖−1, level}(𝑗)=0; Cons{𝑖, level}=𝑗;

     end if

      for  𝑧=2→3→Linefinder(Info)

       Update Info;

      end for

     for  𝑙=1→level

      If Newmarking(Cons{𝑖−2, level}) is not iterated then

       Add Newmarking and enabling matrices to the sequence;

      end if

     end for

    end for

   end if

  end for

 end if

end for

return Cons