Summary. This is the second in a series of two tutorial articles devoted to triangulation-decomposition algorithms. The value of these notes resides in the uniform presentation of triangulation-decomposition of polynomial and differential radical ideals with detailed proofs of all the presented results.We emphasize the study of the mathematical objects manipulated by the algorithms and show their properties independently of those. We also detail a selection of algorithms, one for each task. The present article deals with differential systems. It uses results presented in the first article on polynomial systems but can be read independently.