Rules for Siphon Extraction/Minimisation
20/3/2014
CE-653 - PTnet Theory and some
Algorithms
30
}Rule 6 [Siphon Minimality]
}Let G = (P, T, F) be a
PTnet and S ≤ P a siphon of G.
}S is minimal for G, iff
all reduced nets:
}~Gp = red(G, S-{p}) for all p in S
do not contain siphons
}Rule 7 [Siphon Decomposition
into Smaller Siphons]
}Let G = (P, T, F) be a
PTnet and ~P = {p1, p2, …, pn} ≤ P
}The set of Siphons of G
NOT containing ~P is the Union
where Si is the set of siphons of the reduced net:
~Gi = red(G, P – {pi}), i.e. containing the n places except i.
where Si is the set of siphons of the reduced net:
~Gi = red(G, P – {pi}), i.e. containing the n places except i.
