ABSTRACT
This chapter analyzes the suitability of SGT for representation and use of different types of patterns, which can represent almost everything in physical and digital worlds, especially for simulation and management of large distributed systems. It reviews and classifies existing works on patterns and their languages, shows how practical patterns can be expressed under SGT while giving examples of distributed patterns creation, recognition, and graph-based pattern matching solutions. The chapter provides a summary of the investigated solutions of pattern problems, where SGL can be considered as a real and universal pattern language, with SGT effectively contributing to the pattern theory in general.
