Synthesis time optimal accepting traces using language projection and pruning

The Ramadge-Wonham supervisory control paradigm has been shown effective in dealing with logic control. Nevertheless, time-related performance is always one of the major concerns in industry. Current methods for synthesizing time optimal supervisors are incapable of dealing with large discrete event systems with massive state spaces. This paper proposes a method of finding a time optimal accepting trace for discrete event systems. It also proposes abstraction methods based upon language projection, and pruning capable of finding such traces for large discrete event systems. The algorithms are tested on a large discrete event system model in order to show their effectiveness.