DocumentCode :
3257988
Title :
A new model for improving symbolic product machine traversal
Author :
Cabodi, G. ; Camurati, P. ; Corno, F. ; Gai, S. ; Prinetto, P. ; Reorda, M. Sonza
Author_Institution :
Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
fYear :
1992
fDate :
8-12 Jun 1992
Firstpage :
614
Lastpage :
619
Abstract :
The authors present algorithms for traversing product machines which improve on the results of H. Cho et al. (1991), with a speedup ranging from 3 up to 6. New features include a model that generalizes the product machine, resulting in simpler and more efficient representations and computations, as well as optimizations in symbolic image computation. In the latter case, the speedup ranged from 1.5 to 4
Keywords :
computational complexity; finite state machines; product machines; speedup; symbolic image computation; symbolic product machine traversal; Automata; Automatic control; Automatic test pattern generation; Boolean functions; Circuits; Data structures; Fault diagnosis; Hardware; High level synthesis; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1992. Proceedings., 29th ACM/IEEE
Conference_Location :
Anaheim, CA
ISSN :
0738-100X
Print_ISBN :
0-8186-2822-7
Type :
conf
DOI :
10.1109/DAC.1992.227812
Filename :
227812
Link To Document :
بازگشت