ROBDD

Reduce Ordered Binary Decision Diagram
Model checking & Problem solving
Steve Hostettler
Université de Genève
2 novembre 2007
Steve Hostettler (Université de Genève) Reduce Ordered Binary Decision Diagram 2 novembre 2007 1 / 38
Summary
Introduction
Binary Decision Diagrams
ROBDD Example
OBDD & ROBDD : Definition
Operations on ROBDD
Solving problems
Model checking
ROBDD & Petri nets
Conclusion
Q&A
Introduction
Reduced Ordered Binary Decision Diagrams provide a compact

representation of Boolean functions solutions space.
ROBDD are based on BDD.
Mostly used in problem solving and model checking.
Binary Decision Diagrams
Is a DAG which represents both a Boolean expression and its
solutions. Based on the Shannon Expansion theorem :
F (x1, x2, .., xn) = x1.F (x2, .., xn) + x1.F (x2, .., xn)
ROBDD Example : Build the BDD
ROBDD Example : Factorize nodes
ROBDD Example : Remove useless nodes
ROBDD Example : The result
Reduce BDD on the fly
Isomorphic subgraphs are factorized.

Remove node n if low(n) = high(n), i.e left child = right child.
Use an expression hashtable in order to known whether an expression
has been computed already.
Can be built by ROBDD composition.
Complement function can be built in O(1).
OBDD : Definition
Let X be a set of boolean variables and < a total order on X .

Let N be the set of nodes in the OBDD.
Ordered Binary Decision diagrams are directed graph with :
I Let L be the set of leafes, l ∈ L is labeled with a boolean value
val(l) ∈ {0, 1}.
I Let NL be the set of non-leafes, nl ∈ NL is labeled with a boolean
variable var (nl) ∈ X .
I ∀ni , ni+1 ∈ N :
ni+1 ∈ {low (ni ), high(ni )} =⇒ (ni+1 is a leaf ∨ var (n) < var (ni+1 ))
An OBDD is acyclic.
ROBDD : Definition
An OBDD is called reduced (ROBDD) iff :

∀v , w ∈ L, val(v ) = val(w ) =⇒ v = w .
=⇒ Identical leafes are factorized.
∀v ∈ NL, low (v ) 6= high(v )
=⇒ Non-leafs may not have identical children.
∀v , w ∈ NL :
(var (v ) = var (w )∧low (v ) ∼
= low (w )∧high(v ) ∼
= high(w )) =⇒ v = w
=⇒ Nodes may not have isomorphic subgraphs.
ROBDD (cont’d)
Given a variable ordering, ROBDD are canonical (demonstration by

induction on the size of the variable set) :
f , g : Bn −→ B, f ∼
= g ⇐⇒ ROBDD(f ) ∼ = ROBDD(g ).
Complexity, let K be the number of variables in the ROBDD :
I Best case complexity : O(K ).
I Worst case complexity : O(2K ).
I Test whether a function is constantly true or false in O(1).
Ordering
I Is a NP complete problem.
I Dynamic optimization :
F Reorganized the variable order on the fly.
F Sifting algorithm.
I Heuristics.
Operations on ROBDD
Shannon expansion theorem (Reloaded).

I F (x) ◦ G (x) = [F (x) ◦ G (x)] + [F (x) ◦ (G (x)].
I Requires the same variable ordering on both operand.
I Closure operations.
I Apply any boolean operator :
F Disjunction.
F Conjonction.
F Exclusion.
F Restriction.
I Variable Quantification
F ∀x, F (x) ⇐⇒ F (x) ∧ F (x).
F ∃x, F (x) ⇐⇒ F (x) ∨ F (x).
I Those operators a very useful for model checking.
Solving problems
Define the problem as a set of boolean equations.
Build a ROBDD of the equation and then check if there is a solution.
The N-Queens problem : How to put n queens on a standard n x n
chess board ?
Solving problems (cont’d)
Let Ci,j be the constraint for the position i,j and Qi,j the presence of
a queen at position i,j :
^ ^
C 1i,j = Qi,j . ¬Qk,j .¬Qk,j+i−k .¬Qk,j+k−i . ¬Qi,l
1≤k≤n,k6=i 1≤l≤n,l6=j
^ _
Ci,j = C 1i,j . ( C 1k,j )
1≤l≤n 1≤k≤n
N Variables Nodes ROBDD size

4 16 216 30
5 25 225 195
.
6 36 236 133
7 49 249 1449
8 64 264 3887
.
Model checking
Problem : state space explosion ! ! !
Encoded state machines
Encoding states
Code states on 3 bits :

closed.started.warming +
closed.started.warming
Encoding transitions
Transitions are encoded with the intersection of the start-state, the

final-state and the alphabet :
τ = closed.closed 0 .started.started 0 .warming .warming 0 +
closed.closed 0 .started.started 0 .warming .warming 0 +
closed.closed 0 .started.started 0 .warming .warming +
closed.closed 0 .started.started 0 .warming .warming 0
The best variable ordering for transitions is :
x1 Old < x1 New < x2 Old < x2 New < · · · < xi Old < yi New <
alpha1 < · · · < alphai .
The τ and the τ −1 functions
The τ ( resp. τ −1 )
function is build using
the transition (resp.
reverse transition)
relation.
CTL
Only need algorithms for EX, EU, EG since :

I AX φ ⇐⇒ ¬EX (¬φ)
I AF φ ⇐⇒ ¬EG (¬φ)
I AG φ ⇐⇒ ¬EF (¬φ)
I EF φ ⇐⇒ E [true ∪ φ]
I A[φ ∪ θ] ⇐⇒ ¬E [¬θ ∪ (¬φ ∧ ¬θ)] ∧ ¬EG (¬θ)
EX (φ)
Let F be the set of states satisfying φ :

I S := τ −1 (F)
I Return S
E (φUntilθ)
Let F(resp. G) be the set of states satisfying φ (resp. θ) :

I S := G
I N := ∅
I While( N 6= S)
I do
F N := S ;
F S := S ∪ (F ∩ τ −1 (S))
I done
I Return S
EG (φ)
Let F be the set of states satisfying φ :

I S := F
I N := ∅
I While( N 6= S)
I do
F N := S ;
F S := S ∩ τ −1 (S)
I done
I Return S
EX (¬warming )
Let’s compute the set of states that satisfy EX (¬warming ) :
EX (¬warming ) τ −1 ∩ ¬warning
EX (¬warming ) The result
ROBDD & safe Petri nets
One place, one variable (one hot encoding)

Binary encoding
Safeness can be check on the fly.
ROBDD for bounded & weighted Petri nets
If the place is k-bounded it can be encoded as log2(k+1)-1.

Implements the transistion as a binary substraction.
Check boundness by checking for overfow.
Another example
C0 : a = 1 ∧ b = 1 ; C1 : a ≤ 2 ∧ b ≥ 2 ; C2 : a = 3 ∧ b = 2 ; C3 : a ≤ 2
Another example cont’d
x1 x10 x0 x00 m a1 a0 b1 b0
0 0 0 1 1 0 1 0 1
0 0 0 1 1 1 1 1 0
0 1 0 0 1 1 0 0 1
0 1 0 0 1 1 1 0 1
0 1 0 1 1 1 0 1 0
0 1 0 1 1 1 1 1 0
1 0 0 1 0 0 1 - -
1 0 0 1 0 0 0 - -
1 0 1 0 0 0 1 - -
Parallelism
BDD computation is highly parallelizable..

Several Parallel BDD packages exists for diverse kind of architectures.
Speedup 10x using 16 processors.
Conclusion
Very powerful for particular classes of problem or model.

Must use heuristics in order to determine a good variable ordering.
Q&A
Thank you for your attention.

ROBDD

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ROBDD

Uploaded by

Copyright:

Available Formats

Reduce Ordered Binary Decision Diagram

Model checking & Problem solving

Reduced Ordered Binary Decision Diagrams provide a compact

Isomorphic subgraphs are factorized.

Let X be a set of boolean variables and < a total order on X .

An OBDD is called reduced (ROBDD) iff :

Given a variable ordering, ROBDD are canonical (demonstration by

Shannon expansion theorem (Reloaded).

N Variables Nodes ROBDD size

Problem : state space explosion ! ! !

Code states on 3 bits :

Transitions are encoded with the intersection of the start-state, the

Only need algorithms for EX, EU, EG since :

Let F be the set of states satisfying φ :

Let F(resp. G) be the set of states satisfying φ (resp. θ) :

Let F be the set of states satisfying φ :

One place, one variable (one hot encoding)

If the place is k-bounded it can be encoded as log2(k+1)-1.

BDD computation is highly parallelizable..

Very powerful for particular classes of problem or model.

Thank you for your attention.

You might also like