No abstract

No abstract

No abstract

This paper presents a Finite State Machine approach of grid system, for tracking the state of involved components in a given behavior of this system. In large system context, classic methods such as state composition become timeconsuming and cumbersome due to the explosion problem of combinatorial states. The approach presented in this paper tend to overcome this problem, using finite state machines constructed with median symmetry operators as transition alphabet, and matrices of local components state as vertices.