Arborescent canonical form of boolean expressions
Tochéou Amagbegnon, Loïc Besnard, Paul Le Guernic · 1994
: Signal is a synchronous language designed to program real-time systems. Because of its equational style, its compilation requires the statical resolution of a system of boolean equations; the variables being clocks. This report discusses the arborescent representation of Signal clocks. We introduce a bdd-based data structure called hierarchy. Through the factorization of boolean functions, we show that hierarchies are a canonical form of clocks. We also show that this canonical form optimizes the sequential code generated from a Signal program. We finally link hierarchies to the well known ordering problem of bdds. Key-words: Signal, bdd, clock calculus, boolean lattice (R'esum'e : tsvp) Centre National de la Recherche Scientifique Institut National de Recherche en Informatique (URA 227) Universit e de Rennes 1 -- Insa de Rennes et en Automatique -- unit e de recherche de Rennes Forme Canonique Arborescente des Expressions Bool'eennes R'esum'e : Signal est un langage synchrone ...