Convergence behaviour of structural FSM traversal

  • We present a theoretical analysis of structural FSM traversal, which is the basis for the sequential equivalence checking algorithm Record & Play presented earlier. We compare the convergence behaviour of exact and approximative structural FSM traversal with that of standard BDD-based FSM traversal. We show that for most circuits encountered in practice exact structural FSM traversal reaches the fixed point as fast as symbolic FSM traversal, while approximation can significantly reduce in the number of iterations needed. Our experiments confirm these results.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Dominik Stoffel, Wolfgang Kunz
URN:urn:nbn:de:hebis:30-25226
Parent Title (German):Proc. of the Russian Conference with Foreign Participation on Computer-Aided Technologies in Applied Discrete Mathematics, (ICADM) Oct. 2000, Tomsk, Russia
Document Type:Article
Language:English
Date of Publication (online):2006/03/21
Year of first Publication:2000
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2006/03/21
Source:Proc. of the Russian Conference with Foreign Participation on Computer-Aided Technologies in Applied Discrete Mathematics, (ICADM) Oct. 2000, Tomsk, Russia, ©2001 IEEE
HeBIS-PPN:226069559
Institutes:Informatik und Mathematik / Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):License LogoDeutsches Urheberrecht