{"title":"一种设计最优自检顺序电路的方法","authors":"R. Parekhji, G. Venkatesh, S. Sherlekar","doi":"10.1109/TEST.1991.519520","DOIUrl":null,"url":null,"abstract":"This papcl . presents a formal framework for designing self-checking sequen,tial circuits implemented using the monitoriry machine approach. The two main contributions of this paper are: (1) the formulation of the problcm of &;signing an optimal monitoring machine for arbitrcwy fault m,odcls as the problem of minimizi n g an incompletely specified sequential machine, and (2) rlc?iclopin,g a methodology for performing state assignment which results in the monitoring machine hauiruj (L fized number of states for specific fault models. Thx method allows the designer to ezplorc the tradeofl8 between the cost of implementing the main machine and the mon,itoring machine.","PeriodicalId":272630,"journal":{"name":"1991, Proceedings. International Test Conference","volume":"80 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"A Methodology for Designing Optimal Self-Checking Sequential Circuits\",\"authors\":\"R. Parekhji, G. Venkatesh, S. Sherlekar\",\"doi\":\"10.1109/TEST.1991.519520\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This papcl . presents a formal framework for designing self-checking sequen,tial circuits implemented using the monitoriry machine approach. The two main contributions of this paper are: (1) the formulation of the problcm of &;signing an optimal monitoring machine for arbitrcwy fault m,odcls as the problem of minimizi n g an incompletely specified sequential machine, and (2) rlc?iclopin,g a methodology for performing state assignment which results in the monitoring machine hauiruj (L fized number of states for specific fault models. Thx method allows the designer to ezplorc the tradeofl8 between the cost of implementing the main machine and the mon,itoring machine.\",\"PeriodicalId\":272630,\"journal\":{\"name\":\"1991, Proceedings. International Test Conference\",\"volume\":\"80 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1991, Proceedings. International Test Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TEST.1991.519520\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1991, Proceedings. International Test Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEST.1991.519520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Methodology for Designing Optimal Self-Checking Sequential Circuits
This papcl . presents a formal framework for designing self-checking sequen,tial circuits implemented using the monitoriry machine approach. The two main contributions of this paper are: (1) the formulation of the problcm of &;signing an optimal monitoring machine for arbitrcwy fault m,odcls as the problem of minimizi n g an incompletely specified sequential machine, and (2) rlc?iclopin,g a methodology for performing state assignment which results in the monitoring machine hauiruj (L fized number of states for specific fault models. Thx method allows the designer to ezplorc the tradeofl8 between the cost of implementing the main machine and the mon,itoring machine.