{"title":"The observability don't-care set and its approximations","authors":"P. McGeer, R. Brayton","doi":"10.1109/ICCD.1990.130157","DOIUrl":null,"url":null,"abstract":"The problem of computing the observability don't-care set (nonobservability) for a node in a Boolean network is considered. This problem is generally intractable. Recurrence relations are given for two easily computed subsets of the fanout don't-care set. It is demonstrated that these are, in fact, subsets, and that other subsets appearing in the literature are subsets of those given by the authors.<<ETX>>","PeriodicalId":441935,"journal":{"name":"Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"166 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.1990.130157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
The problem of computing the observability don't-care set (nonobservability) for a node in a Boolean network is considered. This problem is generally intractable. Recurrence relations are given for two easily computed subsets of the fanout don't-care set. It is demonstrated that these are, in fact, subsets, and that other subsets appearing in the literature are subsets of those given by the authors.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
