This paper validates a signed real measure of regular languages and analyzes its robustness by simulation experiments. The simulation scenario consists of four different finite state automaton models of a fighter airplane, each under control of four different discrete-event supervisors. The results of simulation experiments reveal that the language measure is a usable tool for determining the robustness of supervisory controllers relative to small perturbations in language measure parameters and plant model parameters.
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering