<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-21T08:06:48Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81201" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81201</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Fuchs, W. Kent</dc:contributor>
          <dc:creator>Boppana, Vamsi</dc:creator>
          <dc:date>2015-09-25T20:10:02Z</dc:date>
          <dc:date>2015-09-25T20:10:02Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1997</dc:date>
          <dc:date>1997</dc:date>
          <dc:description>Identifying and understanding the capabilities of sequential untestability identification by practical ATPG algorithms is vital to areas such as ATPG-based optimization and ATPG-based verification. This research provides conditions based on the state properties of the good and the faulty machines involved to ensure that the behavior of the circuit in the presence of untestable faults, as identified by practical sequential ATPG algorithms, is not different from the good circuit. This helps alleviate problems faced with the use of such algorithms in applications where inaccuracies in the identified untestabilities are unacceptable.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:10:02Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
9812536.pdf: 3007213 bytes, checksum: 078395d992706fc45b2947a1c0de3062 (MD5)
  Previous issue date: 1997</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82482
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>104 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81201</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI9812536</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>State Information-Based Solutions for Sequential Circuit Diagnosis and Testing</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical Engineering</department>
            <discipline>Electrical Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
