{"title":"Bounds on Shannon functions of lengths of contact closure tests for contact circuits","authors":"K. A. Popkov","doi":"10.1515/dma-2021-0015","DOIUrl":null,"url":null,"abstract":"Abstract We consider the problem of synthesis of irredundant two-pole contact circuits which implement n-place Boolean functions and allow short single fault detection or diagnostic tests of closures of at most k contacts. We prove that the Shannon function of the length of a fault detection test is equal to n for any n and k, and that the Shannon function of the length of a diagnostic test is majorized by n + k(n − 2) for n ⩾ 2.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2021-0015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract We consider the problem of synthesis of irredundant two-pole contact circuits which implement n-place Boolean functions and allow short single fault detection or diagnostic tests of closures of at most k contacts. We prove that the Shannon function of the length of a fault detection test is equal to n for any n and k, and that the Shannon function of the length of a diagnostic test is majorized by n + k(n − 2) for n ⩾ 2.
期刊介绍:
The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.