This article presents a global overview of recent results concerning stochastic automata networks. Among the topics considered is the formalism of an extended tensor algebra, the rigorous definition of a Markovian generator in the form of a descriptor, sufficient conditions for product form, the complexity of the vector-descriptor multiplication, the optimization of this product and some numerical results. The whole is illustrated by numerous typical examples.