{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:29:16Z","timestamp":1757626156213,"version":"3.44.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0167-9260(89)90059-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"49-75","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":42,"title":["A new model for computation of probabilistic testability in combinational circuits"],"prefix":"10.1016","volume":"7","author":[{"given":"Sharad C.","family":"Seth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vishwani D.","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(89)90059-X_BIB1","series-title":"Proc. Int. Test Conf.","first-page":"391","article-title":"Testability measures\u2014What dothey tell us?","author":"Agrawal","year":"1982"},{"key":"10.1016\/0167-9260(89)90059-X_BIB2","series-title":"Proc. Int. Symp. on Circ. Syst. (ISCAS)","first-page":"753","article-title":"The application of probabilistic modeling to the design and fault analysis of digital networks","author":"Bass","year":"1980"},{"key":"10.1016\/0167-9260(89)90059-X_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/TCS.1981.1084999","article-title":"Expected value analysis of combinatorial logic networks","volume":"CAS-28","author":"Bass","year":"1981","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0167-9260(89)90059-X_BIB4_1","series-title":"Proc. Int. Conf. Circ. Comp. (ICCC-80)","first-page":"1162","article-title":"CAMELOT: A computer-aided measure for logic testability","author":"Bennetts","year":"1980"},{"key":"10.1016\/0167-9260(89)90059-X_BIB4_2","first-page":"177","volume":"128","author":"Bennetts","year":"1981"},{"key":"10.1016\/0167-9260(89)90059-X_BIB5","series-title":"Proc. Int. Symp. on Circ. Syst. (ISCAS)","first-page":"221","article-title":"On testability analysis of combinatorial networks","author":"Brglez","year":"1984"},{"key":"10.1016\/0167-9260(89)90059-X_BIB6","series-title":"Proc. Int. Test Conf.","first-page":"705","article-title":"Applications of testability analysis: From ATPG to critical path tracing","author":"Brglez","year":"1984"},{"key":"10.1016\/0167-9260(89)90059-X_BIB7","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1002\/j.1538-7305.1974.tb02802.x","article-title":"Controllability, observability, and maintenance engineering technique (COMET)","volume":"53","author":"Chang","year":"1974","journal-title":"Bell Syst. Tech. J."},{"journal-title":"The TTL Data Book for Engineers","year":"1981","author":"Eng. Staff of Texas Instruments, Inc.","key":"10.1016\/0167-9260(89)90059-X_BIB8"},{"key":"10.1016\/0167-9260(89)90059-X_BIB9","series-title":"Proc. 12th Des. Auto. Conf.","first-page":"290","article-title":"Predicting fault detectability in combinatorial circuits\u2014A new design tool?","author":"Fife","year":"1975"},{"key":"10.1016\/0167-9260(89)90059-X_BIB10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1109\/TCS.1979.1084687","article-title":"Controllability\/observability analysis of digital circuits","volume":"CAS-26","author":"Goldstein","year":"1979","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0167-9260(89)90059-X_BIB11","series-title":"Proc. 17th Des. Auto. Conf.","first-page":"190","article-title":"SCOAP: Sandia controllability\/observability analysis program","author":"Goldstein","year":"1980"},{"key":"10.1016\/0167-9260(89)90059-X_BIB12","series-title":"Proc. 16th Des. Auto. Conf.","first-page":"156","article-title":"TMEAS \u2014 A testability measurement program","author":"Grason","year":"1979"},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/0167-9260(89)90059-X_BIB13"},{"key":"10.1016\/0167-9260(89)90059-X_BIB14","first-page":"6","article-title":"Clarifying statistical fault analysis","volume":"2","author":"Huisman","year":"1985","journal-title":"IEEE Design & Test Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MDT.1985.294683","article-title":"Statistical fault analysis","volume":"2","author":"Jain","year":"1985","journal-title":"IEEE Design & Test Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB16","series-title":"Int. Test Conf. Digest of Papers","first-page":"310","article-title":"Testability analysis","author":"Kovijanic","year":"1979"},{"key":"10.1016\/0167-9260(89)90059-X_BIB17","series-title":"Proc. 14th Des. Auto. Conf.","first-page":"216","article-title":"Practical experiments from signal probability simulation of digital designs","author":"Magnhagen","year":"1977"},{"key":"10.1016\/0167-9260(89)90059-X_BIB18","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1109\/T-C.1975.224257","article-title":"The probability of a correct output from a combinatorial circuit","volume":"C24","author":"Ogus","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB19","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/T-C.1975.224264","article-title":"Analysis of logic circuits with faults using input signal probabilities","volume":"C24","author":"Parker","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB20","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/T-C.1975.224279","article-title":"Probabilistic treatment of general combinatorial circuits","volume":"C-24","author":"Parker","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB21","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TC.1978.1675075","article-title":"Sequential circuit output probabilities from regular expressions","volume":"C-27","author":"Parker","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB22","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1109\/TC.1983.1676183","article-title":"Good controllability and good observability do not guarantee good testability","volume":"C-32","author":"Savir","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB23","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TC.1980.1675603","article-title":"Syndrome testable design of combinatorial circuits","volume":"C-29","author":"Savir","year":"1980","journal-title":"IEEE Trans Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB24","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TC.1984.5009315","article-title":"Random pattern testability","volume":"C-33","author":"Savir","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB25","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TC.1968.227417","article-title":"Analyzing errors with the Boolean difference","volume":"C-17","author":"Sellers","year":"1968","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB26","series-title":"Fault-Tolerant Computing Symposium (FTCS-16) Digest of Papers","first-page":"318","article-title":"An exact analysis for efficient computation of random-pattern testability in combinatorial circuits","author":"Seth","year":"1986"},{"key":"10.1016\/0167-9260(89)90059-X_BIB27","series-title":"Fault-Tolerant Computing Symposium (FTCS-15) Digest of Papers","first-page":"220","article-title":"PREDICT \u2014 Probabilistic Estimation of Digital Circuit Testability","author":"Seth","year":"1985"},{"key":"10.1016\/0167-9260(89)90059-X_BIB28","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/TC.1976.1674668","article-title":"The error latency of a fault in a sequential circuit","volume":"C-25","author":"Shedletsky","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(89)90059-X_BIB29","series-title":"Proc. Int. Test Conf.","first-page":"690","article-title":"Testability Analysis of MOS VLSI circuits","author":"Singer","year":"1984"},{"key":"10.1016\/0167-9260(89)90059-X_BIB30","series-title":"Proc. Int. Symp. Circuits and Systems (ISCAS)","first-page":"663","article-title":"Special Session: Recent Algorithms for Gate-Level ATPG with Fault Simulation and Their Performance Assessment","year":"1985"},{"key":"10.1016\/0167-9260(89)90059-X_BIB31","series-title":"Fault-Tolerant Comp. Symp. (FTCS-6) Digest of Papers","first-page":"101","article-title":"A testability measure for register transfer level digital circuits","author":"Stephenson","year":"1976"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792608990059X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792608990059X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:14Z","timestamp":1757453834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792608990059X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["016792608990059X"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(89)90059-x","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1989,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new model for computation of probabilistic testability in combinational circuits","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(89)90059-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}