{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T10:25:31Z","timestamp":1749205531463,"version":"3.32.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1007\/bf00137392","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T12:30:27Z","timestamp":1099398627000},"page":"163-174","source":"Crossref","is-referenced-by-count":79,"title":["An analytical approach to the partial scan problem"],"prefix":"10.1007","volume":"1","author":[{"given":"Arno","family":"Kunzmann","sequence":"first","affiliation":[]},{"given":"Hans-Joachim","family":"Wunderlich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"V.D. Agrawal, K. Cheng, D.D. Johnson, and T. Lin, ?A complete solution to the partial scan problem,? Proc. IEEE Intern. Test Conf., pp. 44?51, September 1987."},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/54.2032","volume":"6","author":"V.D. Agrawal","year":"1988","unstructured":"V.D. Agrawal, K.-T. Cheng, D.D. Johnson, and T. Lin, ?Designing circuits with partial scan, IEEE Design & Test Comput. 6 (2): 8?15, 1988.","journal-title":"IEEE Design & Test Comput."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M.J.Y. Williams and J.B. Angell, ?Enhancing testability of large scale integrated circuits via test points and additional logic,? IEEE Trans. Comput. C-22 (1), 1973.","DOI":"10.1109\/T-C.1973.223600"},{"key":"CR4","volume-title":"Design of Testable Logic Circuits","author":"R.G. Bennetts","year":"1984","unstructured":"R.G. Bennetts, Design of Testable Logic Circuits, Addison-Wesley, London, 1984."},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/MDT.1984.5005689","volume":"1","author":"J.J. LeBlanc","year":"1984","unstructured":"J.J. LeBlanc, ?LOCST: A built-in self-test technique? IEEE Design & Test Comput. 1 (4): 45?52, 1984.","journal-title":"IEEE Design & Test Comput."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"K. Cheng and V.D. Agrawal, ?An economical scan design for sequential logic test generation,? Proc. 19th Intern. Symp. Fault-Tolerant Comput., pp. 28?35, June 1989.","DOI":"10.1109\/FTCS.1989.105539"},{"issue":"5","key":"CR7","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.21.5.591","volume":"21","author":"N. Christofides","year":"1975","unstructured":"N. Christofides and S. Korman, ?A computational survey of methods for the set covering problem, Management Science 21 (5): 591?599, 1975.","journal-title":"Management Science"},{"key":"CR8","series-title":"Tech. Rep. CU-CS-024-23","volume-title":"An algorithm for finding the elementary circuits of a directed graph","author":"A. Ehrenfeucht","year":"1973","unstructured":"A. Ehrenfeucht, L. Fosdick, and L. Osterweil, ?An algorithm for finding the elementary circuits of a directed graph,? Tech. Rep. CU-CS-024?23, Dept. of Computer Science, University of Colorado, Boulder, 1973."},{"key":"CR9","unstructured":"E.B. Eichelberger and T.W. Williams, ?A logic design structure for LSI testability,? Proc. 14th ACM\/IEEE Design Autom. Conf., pp. 462?468, 1977."},{"key":"CR10","volume-title":"Theory and Design of Switching Circuits","author":"A.D. Friedman","year":"1975","unstructured":"A.D. Friedman and P.R. Menon, Theory and Design of Switching Circuits, Computer Science Press, Rockville, MD, 1975."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"H. Fujiwara and T. Shimono, ?On the acceleration of test generation algorithms,? Proc. 13th Intern. Symp. Fault-Tolerant Comput., pp. 98?105, 1983.","DOI":"10.1109\/TC.1983.1676174"},{"key":"CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco, 1979."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"R. Gupta, R. Gupta, and M.A. Breuer, ?BALLAST: A methodology for partial scan design,? Proc. 19th Intern. Symp. Fault-Tolerant Comput., pp. 118?125, 1989.","DOI":"10.1109\/FTCS.1989.105553"},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TC.1981.1675757","volume":"C-30","author":"P. Goel","year":"1981","unstructured":"P. Goel, ?An implicit enumeration algorithm to generate tests for combinational logic circuits,? IEEE Trans. Comput. C-30 (3): 215?222, 1981.","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"CR15","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1109\/TCS.1979.1084687","volume":"CAS-26","author":"L.H. Goldstein","year":"1979","unstructured":"L.H. Goldstein, ?Controllability\/observability analysis of digital circuits,? IEEE Trans. Circuits and Systems CAS-26 (9): 685?693, 1979.","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"CR16","unstructured":"P. Gutberlet, ?Entwurf eines schnellen Matrizen-Multiplizierers,? Studienarbeit Fakult\u00e4t Informatik, Universit\u00e4t Karlsruhe, 1988."},{"key":"CR17","unstructured":"O. Haberl, ?Entwurf und Implementierung eines PROLOG-Preprozessors als Standardzellen-Chip mit dem Entwurfssystem VENUS,? Diplomarbeit an der Fakult\u00e4t Informatik, Universit\u00e4t Karlsruhe, 1986."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"J. Hartmanis, ?Loop-free structure of sequential machines,? Information and Control (5): 25?43, 1962.","DOI":"10.1016\/S0019-9958(62)90193-6"},{"issue":"1","key":"CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D.B. Johnson","year":"1975","unstructured":"D.B. Johnson, ?Finding all the elementary circuits of a directed graph,? SIAM J. Comput. 4(1): 77?84, 1975.","journal-title":"SIAM J. Comput."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer, Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, ?Reducibility among combinatorial problems,? In R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer, Computations, Plenum Press, New York, pp. 85?103, 1972."},{"key":"CR21","unstructured":"A. Kunzmann, Verbesserung der Testbarkeit von Schaltwerken durch die Integration eines unvollst\u00e4ndigen Pr\u00fcfpfades,? Interner Bericht 25\/87, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Oktober 1987."},{"key":"CR22","unstructured":"A. Kunzmann, ?Produktionstest mit deterministisch bestimmten Testmustern: der Testmustergenerator SPROUT,? Interner Bericht 26\/87, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Oktober 1987."},{"key":"CR23","volume-title":"Produktionstest synchroner Schaltwerke auf der Basis von Pipeline-Stukturen","author":"A. Kunzmann","year":"1988","unstructured":"A. Kunzmann, Produktionstest synchroner Schaltwerke auf der Basis von Pipeline-Stukturen, GI-Jahrestagung, Hamburg, 1988."},{"key":"CR24","unstructured":"A. Kunzmann, ?Test synchroner Schaltwerke auf des Basis partieller Pr\u00fcfpfade,? VDI-Verlag, Fortschritt-Berichte 10 (117), D\u00fcsseldorf, 1989."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"A. Kunzmann and H.-J. Wunderlich, ?Design automation of random testable circuits,? 11th European Solid State Circuits Conf. (ESSCIRC), pp. 277?285, 1985.","DOI":"10.1109\/ESSCIRC.1985.5468113"},{"key":"CR26","unstructured":"ETA LASAR Users Guide, Vers. 4.7, November 1985."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"H.T. Ma et al., ?An incomplete scan design approach to test generation for sequential machines,? Proc. Intern. Test Conf., pp. 730?734, 1988.","DOI":"10.1109\/TEST.1988.207858"},{"issue":"6","key":"CR28","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1109\/TC.1976.1674663","volume":"C-25","author":"P. Muth","year":"1976","unstructured":"P. Muth, ?A nine-valued circuit model for test generation,? IEEE Trans. Comp. C-25 (6): 630?636, 1976.","journal-title":"IEEE Trans. Comp."},{"key":"CR29","unstructured":"J.P. Roth, ?Sequential test generation,? Technical Disclosure Bull., IBM, January 1978."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"M.H. Schulz and E. Auth, ?SOCRATES: Advanced automatic test pattern generation and redundancy identification techniques,? Proc. 18th Intern. Symp. Fault-tolerant Comput., pp. 30?35, Tokyo, 1988.","DOI":"10.1109\/FTCS.1988.5293"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"M.H. Schulz, E. Trischler, and T.M. Sarfert, ?SOCRATES: A highly efficient automatic test pattern generation system,? Proc. Intern. Test Conf., 1987.","DOI":"10.1109\/43.3140"},{"issue":"3","key":"CR32","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R. Tarjan","year":"1973","unstructured":"R. Tarjan, ?Enumeration of the elementary circuits of a directed graph,? SIAM J. Comput. 2 (3): 211?216, 1973.","journal-title":"SIAM J. Comput."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1145\/362814.362819","volume":"13","author":"J.C. Tiernan","year":"1970","unstructured":"J.C. Tiernan, ?An efficient search algorithm to find the elementary circuits of a graph,? Comm. ACM, 13, pp. 722?726, 1970.","journal-title":"Comm. ACM"},{"key":"CR34","unstructured":"E. Trischler, ?Testability analysis and incomplete scan path,? Proc. Intern. Conf. Computer-Aided Design S, pp. 38?39, 1983."},{"key":"CR35","unstructured":"E. Trischler, ?Incomplete scan path with an automatic test generation methodology,? Proc. Intern. Test Conf., pp. 153?162, 1984."},{"key":"CR36","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321679.321684","volume":"19","author":"H. Weinblatt","year":"1972","unstructured":"H. Weinblatt, ?A new search algorithm for finding the simple cycles of a finite directed graph,? J. Assoc. Comput. Mach., 19: 43?56, 1972.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR37","doi-asserted-by":"crossref","unstructured":"H.-J. Wunderlich, ?PROTEST: A tool for probabilistic testability analysis,? Proc. 22th Design Autom. Conf., pp. 204?211, 1985.","DOI":"10.1145\/317825.317858"},{"key":"CR38","doi-asserted-by":"crossref","unstructured":"H.-J. Wunderlich, ?On computing optimized input probabilities for random tests,? Proc. 24th Design Autom. Conf., pp. 382?389, 1987.","DOI":"10.1145\/37888.37947"},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"H.-J. Wunderlich, ?The design of random-testable sequential circuits,? Proc. 19th Intern. Symp. Fault-Tolerant Comput., pp. 110?111, 1989.","DOI":"10.1109\/FTCS.1989.105552"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00137392.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00137392\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00137392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T14:50:01Z","timestamp":1734619801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00137392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["BF00137392"],"URL":"https:\/\/doi.org\/10.1007\/bf00137392","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}