The Sufficient Condition for Liveness of Colored Marked Graph
Qingxing LIN, Kiyohiko Nakamura, Atsunobu Ichikawa · Transactions of the Society of Instrument and Control Engineers · 1994
The purpose of this paper is to investigate liveness of a special class of colored Petri net (CPN) with the structural color matching and the firing color matching introduced by Q. Lin and A. Ichikawa.A CPN is said to be a colored marked graph (CMG) if it is structurally marked graph when color difference in arcs and tokens is ignored.Petri net equivalent to colored marked graph (ECMG) is a new class of a net which has a special structure different from marked graph, conflict free Petri net and free choice Petri net.The sufficient condition is given for existence of a live marking in ECMG by means of deadlock, trap and fairness.