je81
Newbie level 1
Hello,
I am trying to understand variants of Binary Decision Diagrams, but I cannot get it … yes, I have tried google and read a lot of papers concerning MDDs or ADDs, but I have not found an easy example for understanding.
I am having a BDD, and now want to get it compacter. I have created a ZBDD there I understand how it works, but as soon as I want to create a multi-value variant I am stuck. I would like to create a MDD for my problem. I understand I can have more terminal nodes than two, I choose four instead. I would say each node (which is no terminal node) can have four outgoing edges (but there is no need that this needs to be exactly four). I have read that the valence of variable do not need to be identically, does this mean, that one node can have one edge another tree, or what?
I am trying to get a coffee automat from finite state machine from BDD to MDD, the BDD example is attached, is it an easy part, only coffee is choosen, no milk, no sugar. If I design the MDD I would make the terminal nodes ’Coffee in cup’ or ‘Coffee not in cup’.
If I try to understand EVBDD, I am lost, too. I understand that here each node has two outgoing edges (of course not the terminal nodes). The edges are weight and if I add them, I got the function …. I have seen some function in EVBDD, but have not understood how they sum it.
I would be thankful for all hints
Jen
I am trying to understand variants of Binary Decision Diagrams, but I cannot get it … yes, I have tried google and read a lot of papers concerning MDDs or ADDs, but I have not found an easy example for understanding.
I am having a BDD, and now want to get it compacter. I have created a ZBDD there I understand how it works, but as soon as I want to create a multi-value variant I am stuck. I would like to create a MDD for my problem. I understand I can have more terminal nodes than two, I choose four instead. I would say each node (which is no terminal node) can have four outgoing edges (but there is no need that this needs to be exactly four). I have read that the valence of variable do not need to be identically, does this mean, that one node can have one edge another tree, or what?
I am trying to get a coffee automat from finite state machine from BDD to MDD, the BDD example is attached, is it an easy part, only coffee is choosen, no milk, no sugar. If I design the MDD I would make the terminal nodes ’Coffee in cup’ or ‘Coffee not in cup’.
If I try to understand EVBDD, I am lost, too. I understand that here each node has two outgoing edges (of course not the terminal nodes). The edges are weight and if I add them, I got the function …. I have seen some function in EVBDD, but have not understood how they sum it.
I would be thankful for all hints
Jen