A new approach to the study of discrete event systems (DES), characterized by automata, Petri-Nets or related presentations, is proposed. The Boolean Differential Calculus (BDC) supports modeling, analysis and synthesis of DES. This paper not only demonstrates fundamental properties of the BDC, but also presents a synthesis algorithm for the cat-mouse-example.