Several algorithms exist to reduce the rank of an ordinary linear differential system at a point, say 0, to its minimal value, the Poincaré rank (also, sometimes called true Poincaré rank). We extend Levelt algorithm, based on the existence of stationary sequences of free lattices, to completely integrable Pfaffian systems with normal crossings in two variables dY =" 1x p+1 A(x, y)dx +
General TermsAlgorithms