This paper addresses the problem of computing a polyhedral Lyapunov functio
n (PLF) for a linear differential inclusion (LDI). A numerically efficient
algorithm is presented to compute a PLF for an LDI. It is also pointed out
that for the case of a polyhedron defined by vertices (rather than by faces
) one can state algebraic stability conditions analogous to those given by
Molchanov and Pyatnitskiy (1986). (C) 2000 Elsevier Science Ltd. All rights
reserved.