{"title":"一类受控Petri网的鲁棒性","authors":"Fu-Shiung Hsieh","doi":"10.1109/SSST.2004.1295626","DOIUrl":null,"url":null,"abstract":"In our previous works, we have unveiled the fault tolerant properties of several subclasses of controlled Petri nets, including CPPN, MG-refined nets and CAPN. In this paper, we extend the results to a class of controlled Petri net with uncertainties and flexible routes (CPNU-FR). By exploiting the routing flexibility of a CPNU-FR, we characterize a feasible condition to maintain production for a certain type of products by keeping the liveness of a cyclic production route. Based on this condition, we propose a structural decomposition method to test the feasibility of production routes. Based on the liveness condition for the nominal CPN, we characterize a condition to test whether a certain type of resource failures is tolerable.","PeriodicalId":309617,"journal":{"name":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Robustness of a class of controlled Petri nets\",\"authors\":\"Fu-Shiung Hsieh\",\"doi\":\"10.1109/SSST.2004.1295626\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In our previous works, we have unveiled the fault tolerant properties of several subclasses of controlled Petri nets, including CPPN, MG-refined nets and CAPN. In this paper, we extend the results to a class of controlled Petri net with uncertainties and flexible routes (CPNU-FR). By exploiting the routing flexibility of a CPNU-FR, we characterize a feasible condition to maintain production for a certain type of products by keeping the liveness of a cyclic production route. Based on this condition, we propose a structural decomposition method to test the feasibility of production routes. Based on the liveness condition for the nominal CPN, we characterize a condition to test whether a certain type of resource failures is tolerable.\",\"PeriodicalId\":309617,\"journal\":{\"name\":\"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.2004.1295626\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.2004.1295626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In our previous works, we have unveiled the fault tolerant properties of several subclasses of controlled Petri nets, including CPPN, MG-refined nets and CAPN. In this paper, we extend the results to a class of controlled Petri net with uncertainties and flexible routes (CPNU-FR). By exploiting the routing flexibility of a CPNU-FR, we characterize a feasible condition to maintain production for a certain type of products by keeping the liveness of a cyclic production route. Based on this condition, we propose a structural decomposition method to test the feasibility of production routes. Based on the liveness condition for the nominal CPN, we characterize a condition to test whether a certain type of resource failures is tolerable.