A performance evaluation algorithm for discrete event systems under blocking

Sometimes, under control of a supervisor a discrete event system could constitute a conservative solution in this case relaxing the blocking becomes an inevitable fact to improve the performance. Meanwhile the balance between blocking and achievement has to be preserved. So the strings that drive the system to blocking and also the strings causing achievement have to be investigated in a numerical manner. For this purpose in this study a new performance measure is introduced. The elements of the performance measure depend on numeric values obtained from strings that correspond to blocking and success so the proposed formulation captures the fundamental trade-off motivated by the classical optimization approach. Then a new algorithm that explores the best result according to this performance measure is introduced.