1. Kuz’min, E.V. and Sokolov, V.A., Vpolne strukturirovannye sistemy pomechennykh perekhodov (Well-Structured Systems of Marked Transitions), Moscow: Fizmatlit, 2005.
2. Nemytykh, A.P., Superkompilyator SCP4: obshchaya struktura (Supercompiler SCP4: General Structure), Moscow: Editorial URSS, 2007.
3. Aziz, P.A., Čerāns, K., Jonsson, B., and Tsay, Y.-K., General Decidability Theorems for Infinite-State Systems, Proc. 11th Ann. IEEE Symp. on Logic in Computer Science, New Brunswick, 1996, pp. 313–321.
4. Dufourd, C., Finkel, A., and Schnoebelen, F., Reset Nets between Decidability and Undecidability, Proc. 25th Int. Colloq. on Automata, Languages and Programming, ICALP’98, Aalborg, 1998.
5. Geeraerts, G., Coverability and Expressiveness Properties of Well-Structured Transition Systems, PhD Thesis, Bruxelles: Université Libre de Bruxelle, 2007. http://www.ulb.ac.be/di/verify/ggeeraer/thesis.pdf