Vertex control of flows in networks

Abstract

We study a transport equation in a network and control it in asingle vertex. We describe all possible reachable states and prove acriterion of Kalman type for those vertices in which the problem ismaximally controllable. The results are then applied to concretenetworks to show the complexity of the problem.