By Topic

Finite state machine verification on MIMD machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kumar, N. ; Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH, USA ; Vemuri, R.

The authors present a parallel algorithm for finite state machine (FSM) verification on multiple instruction/multiple data (MIMD) machines. Given two FSMs, the verification process consists of dynamically constructing the product machine and investigating the reachability of the failure state (from the start state) of the product machine in a distributed fashion. The technique partitions one of the FSMs across a set of processors by distributing the states of the FSM among the processors. Experimental results on benchmark circuits demonstrate near linear speedup

Published in:

Design Automation Conference, 1992., EURO-VHDL '92, EURO-DAC '92. European

Date of Conference:

7-10 Sep 1992