“…3.1 Definition: Petri net [3,5] A Petri net structure is a four tuple C = (P, T, I, O) where P = {p 1 , p 2 ,....., p n } is a finite set of places, n ≥ 0, T = {t 1 , t 2 ,…, t m } is a finite set of transitions m ≥ 0, P∩T= Ø, I: T→P∞ is the input function from transitions to bags of places and O: T→P∞ is the output function from transitions to bags of places. [3,5] An Array Token Petri net Structure (ATPNS) is a five tuple N = (Σ, C, M 0 , σ, F) where Σ is a given alphabet, C = (P, T, I, O) is a Petri net structure with Arrays of Σ** in certain places of P as initial markings, M 0 : P → Σ**, σ: T →L a mapping on the set of transitions to the set of labels and a finite set of final places F P.…”