In this paper we introduce the growth function of a Petri net. We show that the growth function of any Petri net is bounded by a certain polynomial. There are relations between the growth function and the representative complexity of the language which is accepted by a Petri net.