This paper presents the Backward reachability which is a structural analysis method applicable to Colored Petri Nets (CPN). This method avoids the fastidious computation of simulation and the combinatorial explosion of reachable state space. The backward reachability provides the information about different ways of reaching a particular CPN marking. This evaluation considers the evolution of markings participating in each sequence leading to the desired state. The analysis is performed on an inverse CPN which is obtained by transforming original CPN according to given inversion rules. The work develops the rules allowing the definition of inverse CPN and presents some transformations that contribute to the analysis speed up. The main advantage of this method is that it allows to determine the sequence leading from any initial state to a given final marking without investigating all possible sequences.