Generic implementation of DD packages in MVL

This paper presents a generic approach to implementation of Decision Diagrams (DDs) for representation and manipulation of Multi-Valued Logic (MVL) functions. The core package is based on recursive synthesis operations, where the recursive step is given by a table look-up technique. This allows to simply exchange the decomposition type without reimplementation of the complete program. The approach can easily be used for prototyping of MVL DD packages. We investigate the problem from a theoretical point of view, i.e. several decompositions that can be realized using the technique are given. Experimental results are reported to demonstrate the efficiency of the approach.