Information Technology Journal1812-56381812-5646Asian Network for Scientific Information10.3923/itj.2011.106.112CuiTingting ZengQingtian ZhangDongli 12011101S-Net is a kind of structure-simple Petri nets and its behaviors are easy to be specified. In this study, we observed the classification of S-Nets and then gave the recognition method of every kind of S-Nets. A finite automaton is constructed first that can be used to recognize the language of a bounded Petri net. Based on the finite automaton constructed, the language recognition algorithm for each kind of S-Nets is proposed and the time complexity of the proposed algorithm is discussed. By several groups of experimental data, the time complexities of the proposed algorithms are checked.]]>Zeng, Q. and Z. Wu,2004Zeng, Q.T. and Z.H. Wu,2002Zeng, Q.T., Z.H. Wu and B.X. Ma,2004Jiang, C.J. and W.M., Lu,2001Jiang, C.J., Y.P. Zheng and S.G. Shu,1997Jiang, C.J., Z.H. Wu and C.H. Wang,1998Garg, V.K. and M.T. Ragunath,1992Wu, Z.H.,2006Zeng, Q.T.,2004