Computing the transitive closure of a state transition relation

Yusuke Matsunaga, Patrick C. McGeer, Robert K. Brayton

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Pages260-265
Number of pages6
ISBN (Print)0897915771
Publication statusPublished - Jan 1 1993
Externally publishedYes
EventProceedings of the 30th ACM/IEEE Design Automation Conference - Dallas, TX, USA
Duration: Jun 14 1993Jun 18 1993

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0146-7123

Other

OtherProceedings of the 30th ACM/IEEE Design Automation Conference
CityDallas, TX, USA
Period6/14/936/18/93

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Matsunaga, Y., McGeer, P. C., & Brayton, R. K. (1993). Computing the transitive closure of a state transition relation. In Proceedings - Design Automation Conference (pp. 260-265). (Proceedings - Design Automation Conference). Publ by IEEE.