A special class of graph, the “systems net,” is defined The set of all systems nets is broken down into equivalence classes, which are shown to be partially ordered by a particular type of condensation, the “simplification.” Finally, every class of systems net is shown to have a unique maximal simplification, and applications of the concepts of “systems net” and “simplification” to automaton modeling are discussed.