Abstract:
Neighborhood structures (digraphs of a special kind) can have vertex or relational sets of equipping variables. Vertex variables correspond to the vertices of the structure, while the relational ones correspond to the arcs. The article describes an algorithm for the canonical transformation (declusterization) of the relational structures into the vertex ones. This transformation establishes a connection between two types of control metasystems on neighborhood structures.