[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/Pradhan83>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Dhiraj_K._Pradhan>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FTC.1983.1676225>
foaf:homepage <https://doi.org/10.1109/TC.1983.1676225>
dc:identifier DBLP journals/tc/Pradhan83 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FTC.1983.1676225 (xsd:string)
dcterms:issued 1983 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label Sequential Network Design Using Extra Inputs for Fault Detection. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Dhiraj_K._Pradhan>
swrc:number 3 (xsd:string)
swrc:pages 319-323 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/Pradhan83/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/Pradhan83>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc32.html#Pradhan83>
rdfs:seeAlso <https://doi.org/10.1109/TC.1983.1676225>
dc:subject sequential machine, In order to enhance fault-detection capability, extra inputs are used when designing sequential machines; Here, a technique is proposed that designs these machines, precisely with the use of extra inputs?so as especially to minimize the length of the checking sequence; The resulting checking sequences are shown to be upper bounded by (3 + 2n)m+rn(3m + 1), where n is the number of states, r is the number of inputs, m = logs, n, and s is the number of extra inputs, respectively., Checking sequence, diameter of graphs, directed graphs, distinguishing sequence, fault detection (xsd:string)
dc:title Sequential Network Design Using Extra Inputs for Fault Detection. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 32 (xsd:string)