Substitution and Flip BDDs

Rune Møller Jensen, Henrik Reif Andersen

    Research output: Book / Anthology / ReportReportResearch

    Abstract

    This report introduces two novel approaches for representing transition functions of finite transition systems encoded as Binary Decision Diagrams (BDDs). The first approach is substitution BDDs where each transition is represented by a corresponding substitution on state variables. The second is flip BDDs where each transition is defined by the set of state variables with flipped value. We show that substitution BDDs can be used to find and propagate write conflicts in synchronous and asynchronous compositions. Furthermore, our experimental evaluation suggest that the complexity of image computations based on flip BDDs may compare positively to the usual relational product computation.
    Original languageEnglish
    PublisherIT University of Copenhagen
    EditionTR-2003-41
    Number of pages24
    ISBN (Print) 8779490557
    Publication statusPublished - 2003
    SeriesIT University Technical Report Series
    NumberTR-2003-41
    ISSN1600-6100

    Keywords

    • finite transition systems
    • Binary Decision Diagrams
    • substitution BDDs
    • flip BDDs
    • image computation

    Fingerprint

    Dive into the research topics of 'Substitution and Flip BDDs'. Together they form a unique fingerprint.

    Cite this