Abstract
This paper deals with the probability of classical system-theoretic properties of random linear systems defined over a finite field. Explicit formulas are derived for the probability that the reachability matrix of a linear system has rank r. We also calculate the probability that the parallel connection of two single-input systems is reachable. Our results should be viewed as a first step to calculate the probability that a network of linear systems is reachable.