, for a given automaton $G$ and a language $K$, the controllability condition is checked by comparing the active event set of each state of $H\times G$ with the active event set of each state of $G$, where automaton $H$ generates $pr(K)$. And the observability condition is checked by building an observer of an automaton with unobservable events at each site \[0\].  