Generalized language measure families of probabilistic finite state systems

Ishanu Chattopadhyay, Asok Kumar Ray · International Journal of Control · 2007

The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis of discrete-event systems. This paper reports generalizations of the language measure, which can serve as performance indices for synthesis of optimal discrete-event supervisory decision and control laws. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples.

Read the paper · More papers on PaperTik