TY - GEN
T1 - Computing the transitive closure of a state transition relation
AU - Matsunaga, Yusuke
AU - McGeer, Patrick C.
AU - Brayton, Robert K.
PY - 1993/1/1
Y1 - 1993/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027290275&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027290275&partnerID=8YFLogxK
U2 - 10.1145/157485.164884
DO - 10.1145/157485.164884
M3 - Conference contribution
AN - SCOPUS:0027290275
SN - 0897915771
SN - 9780897915779
T3 - Proceedings - Design Automation Conference
SP - 260
EP - 265
BT - Proceedings - Design Automation Conference
PB - Publ by IEEE
T2 - Proceedings of the 30th ACM/IEEE Design Automation Conference
Y2 - 14 June 1993 through 18 June 1993
ER -