Computer algebra in scientific computing---CASC'99
We consider computational and implementation issues for the completion of monomial sets to involution using different involutive divisions. Every one of these divisions prodces its own completion procedure. For the polynmial case it yields an involutive basis which is a special form of a Gröbner basis, generally redundant. We also compare our Mathematica implementation of Janet division to an implementation in C.