Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Enhancement suggestion: fast BDD algorithm for large coherent boolean functions #17

Open
glarange opened this issue Jun 20, 2020 · 1 comment

Comments

@glarange
Copy link

glarange commented Jun 20, 2020

Hi Tom,

Would you be interested in implementing a subsume function for coherent functions. Speeds up large-scale trees used in reliability of nuclear plants and electric grid. Widely used in energy.

image

I'd appreciate if you could give me some guidance as I'm not the most experienced in C or development in general.

Thanks,
Gui

More details in attached paper.

Thanks,
Gui
a fast BDD algorithm for large coherent fault trees analysis.pdf

@trolando
Copy link
Contributor

Hey @glarange my apologies for missing this earlier. I'm interested in this, currently doing some maintenance on Sylvan in fact (See on my trolando github page github.com/trolando/sylvan).

I'll get back to this. I have some colleagues who also work on fault tree analysis. @raulmonti and others.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants