In this paper, we study some results of extended timed event graphs (ETEG) by using graph theory's methods in the dioid framework. A necessary and sufficient condition for reach-ability of ETEG is obtained and ETEG's reach-ability standard structure is also acquired. On these base, we classify components of the controllable sequences in the supervisory controllable into three classes and simplify their computing.
展开▼
