DocumentCode :
451896
Title :
On Computing the Transitive Closure of a State Transition Relation
Author :
Matsunaga, Yusuke ; McGeer, Patrick C. ; Brayton, Robert K.
Author_Institution :
Fujitsu Laboratories, Kawasaki, Japan
fYear :
1993
fDate :
14-18 June 1993
Firstpage :
260
Lastpage :
265
Abstract :
We describe a new, recursive-descent procedure for the computation of the transitive closure of a transition relation. This procedure is the classic binary matrix procedure of [1], adapted to a BDD data structure. We demonstrate its efficacy when compared to standard iterative methods.
Keywords :
Automata; Binary decision diagrams; Boolean functions; Convergence; Data structures; Distributed computing; Equations; Iterative methods; Permission; Smoothing methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1993. 30th Conference on
ISSN :
0738-100X
Print_ISBN :
0-89791-577-1
Type :
conf
DOI :
10.1109/DAC.1993.203956
Filename :
1600229
Link To Document :
بازگشت