On language convergence in discrete-event systems
Yosef Willner, Michael A Heymann · 2002
Uses the formalism of omega -languages, that is, formal languages consisting of infinite strings. The behavior of a DES P converges to a given omega -language E if after a finite number of state transitions, P executes only infinite strings that belong to E. The authors investigate the problem of synthesizing a supervisor under which the closed-loop system converges to E.>