Implementation of Relational Algebra Using Binary Decision Diagrams

We show how relations and their operations can efficiently be implemented by means of Binary Decision Diagrams. This implementation is used in the computer system RELVIEW. To demonstrate the power of the approach, we show how it can be applied to attack computationally hard problems.

[1]  Gunther Schmidt,et al.  Relational Methods in Computer Science , 1999, Inf. Sci..

[2]  Rudolf Berghammer,et al.  Realtion-Algebraic Analysis of Petri Nets with RELVIEW , 1996, TACAS.

[3]  Chen-Shang Lin,et al.  On the OBDD-Representation of General Boolean Functions , 1992, IEEE Trans. Computers.

[4]  Ralf Behnke,et al.  RELVIEW - A System for Calculating With Relations and Relational Programming , 1998, FASE.

[5]  Rudolf Berghammer,et al.  Modeling Sequences within the RelView System , 2001, J. Univers. Comput. Sci..

[6]  Rudolf Berghammer,et al.  Applications of the Rel View System , 1998, Tool Support for System Specification, Development and Verification.

[7]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[8]  Gunther Schmidt,et al.  Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[9]  Gunther Schmidt,et al.  Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.