Partitioning transition relations efficiently and automatically

  • Authors:
  • Z. Zhou;X. Song;F. Corella;E. Cerny;M. Langevin

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • GLSVLSI '95 Proceedings of the Fifth Great Lakes Symposium on VLSI (GLSVLSI'95)
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiway Decision Graphs (MDGs) have been recently proposed as an efficient representation of Extended Finite State Machines (EFSMs), suitable for automatic hardware verification of Register Transfer Level (RTL) designs. We report here on the results of our research into automatic partitioning of state transition relations described using MDGs. The objective is to achieve the maximum possible performance during an abstract implicit state enumeration procedure that is at the basis of our automatic verification method.