{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:12Z","timestamp":1725663672729},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540522928"},{"type":"electronic","value":"9783540469506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52292-1_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:30:15Z","timestamp":1330187415000},"page":"34-45","source":"Crossref","is-referenced-by-count":3,"title":["t\/s-Diagnosable systems: A characterization and diagnosis algorithm"],"prefix":"10.1007","author":[{"given":"A.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Thulasiraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. K.","family":"Agarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. B.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"EC-16","author":"F.P. Preparata","year":"1967","unstructured":"Preparata, F.P., Metze, G., Chlen, R.T., \"On the Connection Asslgnment Problem of Diagnosable Systems,\" IEEE Trans. Electr. Compt., vol EC-16, pp. 848\u2013854, Dec 1967.","journal-title":"IEEE Trans. Electr. Compt."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/T-C.1974.223782","volume":"C-23","author":"S.L. Hakimi","year":"1974","unstructured":"Hakimi, S.L., Amin, A., \"Characterization of the Connection Assignment of Diagnosable Systems,\" IEEE Trans. Comp., vol C-23, pp 86\u201388, Jan 1974.","journal-title":"IEEE Trans. Comp."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Sullivan, G.F., \"A Polynomial Time Algorithm for Fault Diagnosability,\" In Proc. 25th Annu. Symp. Foundations Comp. Sc., pp. 148\u2013156, Oct 1984.","DOI":"10.1109\/SFCS.1984.715911"},{"key":"3_CR4","unstructured":"Dahbura, A.T., Masson, G.M., \"A Practical Variation of the O(n\n2.5) Fault Diagnosis Algorithm,\" In 14th Int. Symp. Fault-Tolerant Comput., 1984."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/12.2182","volume":"C-37","author":"G.F. Sullivan","year":"1988","unstructured":"Sullivan, G.F., \"An O(t\n3+|E|) Fault Identification Algorithm for Diagnosable Systems,\" IEEE Trans. Comp., vol C-37, pp. 388\u2013397, April 1988.","journal-title":"IEEE Trans. Comp."},{"key":"3_CR6","unstructured":"Friedman, A.D., \"A New Measure of Digital System Diagnosis,\" In Dig. 1975 Int. Symp. Fault-Tolerant Comput., pp. 167\u2013170, June 1975."},{"key":"3_CR7","unstructured":"Kavianpour, A., Friedman, A.D., \"Efficient Design of Easily Diagnosable Systems,\" In Proc. 3rd USA-Japan Comput. Conf., pp. 251\u2013257, 1978."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/TC.1981.1675807","volume":"C-30","author":"K.Y. Chwa","year":"1981","unstructured":"Chwa, K.Y., Hakimi, S.L., \"On Fault Identification in Diagnosable Systems,\" IEEE Trans. Comp., vol. C-30, pp. 414\u2013422, June 1981.","journal-title":"IEEE Trans. Comp."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/TC.1986.1676805","volume":"C-35","author":"C.L. Yang","year":"1986","unstructured":"Yang, C.L., Masson, G.M., Leonetti, R.A., \"On Fault Identification and Isolation in t\n1\/t\n2-Diagnosable Systems,\" IEEE Trans. Comp., vol C-35, pp. 639\u2013643, July 1986.","journal-title":"IEEE Trans. Comp."},{"key":"3_CR10","unstructured":"Sullivan, G., \"The Complexity of System-Level Fault Diagnosis and Diagnosability,\" Ph.D. Dissertation, Yale University, 1986."},{"key":"3_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, New York: Elsevier North-Holland 1976."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Karp, R.M., \"A n\n2.5 algorithm for maximum matching in bipartite graphs,\" SIAM J. Comput., vol. 2, Dec 1973.","DOI":"10.1137\/0202019"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52292-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:07:36Z","timestamp":1619557656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52292-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522928","9783540469506"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-52292-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}