Finite state machine verification on MIMD machines

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.<<ETX>>

[1]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Srinivas Devadas,et al.  Verification of interacting sequential circuits , 1991, DAC '90.

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  Logic verification algorithms and their parallel implementation , 1989 .

[4]  Michael J. Quinn,et al.  Designing Efficient Algorithms for Parallel Computers , 1987 .

[5]  K. Mani Chandy,et al.  Termination Detection of Diffusing Computations in Communicating Sequential Processes , 1982, TOPL.

[6]  A. Richard Newton,et al.  An efficient verifier for finite state machines , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Paolo Prinetto,et al.  Proving finite state machines correct with an automaton-based method , 1991, [1991] Proceedings. First Great Lakes Symposium on VLSI.

[8]  Seh-Woong Jeong,et al.  ATPG aspects of FSM verification , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[9]  Gary D. Hachtel,et al.  Verification algorithms for VLSI synthesis , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, ICCAD 1990.

[11]  Srinivas Devadas,et al.  On the verification of sequential machines at differing levels of abstraction , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

[13]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[14]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[15]  Michel Raynal,et al.  Distributed algorithms and protocols , 1988 .

[16]  Srinivas Devadas,et al.  Implicit state transition graphs: applications to sequential logic synthesis and test , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.