{"title":"混合故障诊断系统的递归优化设计","authors":"T. Kohda, Ken-ichi Abiru","doi":"10.1109/FTCS.1988.5331","DOIUrl":null,"url":null,"abstract":"The authors give a simple recursive procedure for designing an optimal n-unit t/r/r-diagnosable system on the basis of an optimal n'-unit t'/r'/r'-diagnosable system where t>or=t', r>or=r', and n>or=n'. This recursive procedure is shown to be of great flexibility. Furthermore, it is shown that the procedure can produce a large number of optimal hybrid-fault-diagnosable systems.<<ETX>>","PeriodicalId":171148,"journal":{"name":"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A recursive procedure for optimally designing a hybrid fault diagnosable system\",\"authors\":\"T. Kohda, Ken-ichi Abiru\",\"doi\":\"10.1109/FTCS.1988.5331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors give a simple recursive procedure for designing an optimal n-unit t/r/r-diagnosable system on the basis of an optimal n'-unit t'/r'/r'-diagnosable system where t>or=t', r>or=r', and n>or=n'. This recursive procedure is shown to be of great flexibility. Furthermore, it is shown that the procedure can produce a large number of optimal hybrid-fault-diagnosable systems.<<ETX>>\",\"PeriodicalId\":171148,\"journal\":{\"name\":\"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1988.5331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1988.5331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A recursive procedure for optimally designing a hybrid fault diagnosable system
The authors give a simple recursive procedure for designing an optimal n-unit t/r/r-diagnosable system on the basis of an optimal n'-unit t'/r'/r'-diagnosable system where t>or=t', r>or=r', and n>or=n'. This recursive procedure is shown to be of great flexibility. Furthermore, it is shown that the procedure can produce a large number of optimal hybrid-fault-diagnosable systems.<>