Abstract In this paper, we present an algebraic approach to the precise and global verification explanation of Rectifier Neural Networks , a subclass Piece-wise Linear (PLNNs), i.e., networks that semantically represent piece-wise affine functions. Key our is symbolic execution these allows construction equivalent Typed Affine Decision Structures (TADS). Due their deterministic sequential natur...