Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers

1.6k comments

524 users

0 votes

In this question, one ROBDD is already given, what steps to follow to draw the equivalent ROBDD with variable ordering c<b<a?

Thanks in advance! 

in * TF "Emb. Sys. and Rob." by (1.1k points)

1 Answer

0 votes
 
Best answer
There are several options. You could read the formula from the ROBDD (here ¬a∧¬c ∨ a∧b∧c ∨ a∧¬b∧¬c), and draw a new ROBDD of it from scratch. Or you can reuse the part of the ROBDD where the changed variable order makes no difference (the low-branch of the a-root), and just re-draw the (sub-)ROBDD for a = true. As this (sub-)ROBDD just represents a↔b, only the b- and c-nodes flip their labels.
by (25.6k points)
selected by
The above mentioned alternative means to apply the swap operation that is described in the slides.
I checked in the slide. Thanks.
Can you please specify which slide number. I am not able to find it. Thank you.
slide 71 of the BDD chapter
Thank you :)

Related questions

Imprint | Privacy Policy
...