ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Computing minimal representations with binary decision diagrams

Royers, Amaury
(2016)

Files

Royers_26860500_2015.pdf
  • UCLouvain restricted access
  • Adobe PDF
  • 758.96 KB

Details

Supervisors
Pecheur, Charles ; Busard, Simon
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] : ingénieur civil en informatique
Abstract
Two-level logic minimization is a complex problem, but can lead to multiple advantages. Having the ability of reducing a boolean function can lead to better performances from applications using those. Olivier Coudert developed a state-of-the-art algorithm called SCHERZO being more powerful than any other algorithm created before. This work aims to develop SCHERZO in PyNuSMV, a python framework working on SMV files. The development of the algorithm made use of ZDD from CUDD imported through SWIG.