Analysis of temporal performance of supervised discrete event systems
β Scribed by Feng Lin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 338 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we discuss temporal performance of supervised discrete event systems by comparing two supervisors for one discrete event system. We show that the temporal performance of the supervised systems can be inferred by their logical properties described by the languages generated. More precisely, for two supervised systems, if the language generated by the first system is contained in the language generated by the second and if the language generated by the second satisfies a certain fairness condition with respect to a set of events of particular interest, then every occurrence of events in the set occurs earlier in the second system. In this sense, the supervisor generating the larger language is better. We extend this result to the asymptotic behaviors, where the conditions for optimality are weaker. An example is given to illustrate applications of the results.
the two supervised systems SI/G and S2/G. The only differences between two systems are structural differences *
π SIMILAR VOLUMES
## A speczal class of performance evaluation problems of discrete event dynamtc systems ts tdentzfied to allow the apphcatton of mfimteslmal perturbation analysts Key Words--(Discrete event dynamic systems), queuemg systems, slmulauon, (perturbation analysis) Alalr~'t--In this paper, a criterion f
We discuss different aspects of the related issues. In particular, we show that the necessary condition developed by and for multiple IPA estimates to simultaneously converge is not necessary for any IPA estimate to converge.