Title :
Fairness Analysis of Petri Synthesis Net
Author_Institution :
Sch. of Comput. Sci. & Technol., Shandong Jianzhu Univ., Jinan, China
Abstract :
The synthesis technique of Petri nets shared subnets can avoid the state exploration problem, which is of exponential complexity, by guaranteeing the correctness in the Petri net while incrementally expanding the net. One major advantage of the synthesis technique is that the resultant Petri net is guaranteed to be fair. Conditions of fairness preservation are proposed. A flexible manufacturing system has been designed. These results are useful for studying the static and dynamic properties of Petri net.
Keywords :
Petri nets; computational complexity; Petri synthesis net; dynamic properties; exponential complexity; fairness analysis; manufacturing system; state exploration problem; Computational modeling; Computers; Control systems; Laboratories; Manufacturing systems; Petri nets; Petri nets; fairness; property analysis; synthesis; system design;
Conference_Titel :
Electronic Commerce and Security (ISECS), 2010 Third International Symposium on
Conference_Location :
Guangzhou
Print_ISBN :
978-1-4244-8231-3
Electronic_ISBN :
978-1-4244-8231-3
DOI :
10.1109/ISECS.2010.46