1. Example Simple graph Binary Decision Tree Binary Decision Diagram …
All graphs
Directed graphs
Trees
PAG
BDT
BDD

2. BDD Binary decision diagram (BDD) Specs
Rooted binary directed acyclic graph
Data structure representing Boolean functions
Formal verification, fault tree analysis, etc.
Specs
Variables
High/low links
2 terminal nodes called 0-terminal and 1-terminal
Constraints
Can only be one root
Can only be 1 of each terminal nodes (0,1)

3. Features & Tricks Connecting nodes time efficiently Pasting Icons
Paradigm info (version mapping)
Help notes (of attributes) and annotations
Reset to default (attributes)
Grid
Search & TableEditor
Custom text editor for string attributes
Model Libraries
Language design: using Proxies (the meta-level References)
For getting rid of the clutter caused by associations (containment, etc)
Working with XML and text-replace when appropriate

4. Possible Problems Double installation
Incompatibility problem w/ binary files
The case of the Lost Paradigm
Emergency events
Single-threaded GME