Fast state verification

  • Authors:
  • Dechang Sun;Bapiraju Vinnakota;Wanli Jiang

  • Affiliations:
  • Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN;Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN;Dept. of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN

  • Venue:
  • DAC '98 Proceedings of the 35th annual Design Automation Conference
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Unique input/output(UIO) sequences are used for state verification and functional test in finite state machines. A UIO sequence for a state s distinguishes it from other states in the FSM. Current algorithms to compute UIO sequences are limited in their applicability to FSMs with binary input symbols such as those found in con trol applications. Execution times of traditional approaches are exponential in the n umber of FSM inputs. We dev elop a new heuristic algorithm to generate UIO sequences for FSMs with binary inputs. Execution time is reduced significantly b y reducing the size of the search space. When a UIO sequence cannot be generated, our algorithm generates a small n umber of functional faults for state verification.