Generalized language measure families of probabilistic finite state systems

I. Chattopadhyay, A. Ray

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)789-799
Number of pages11
JournalInternational Journal of Control
Issue number5
StatePublished - May 2007

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications


Dive into the research topics of 'Generalized language measure families of probabilistic finite state systems'. Together they form a unique fingerprint.

Cite this