A language measure for performance evaluation of discrete-event supervisory control systems

Xi Wang, Asok Ray

Research output: Contribution to journalArticlepeer-review

46 Scopus citations

Abstract

This paper formulates a signed real measure of sublanguages of a regular language based on the principles of automata theory and real analysis. The measure allows total ordering of any set of partially ordered sublanguages of a regular language for quantitative evaluation of the controlled behavior of a deterministic finite-state automaton (DFSA) plant under different supervisors. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.

Original languageEnglish (US)
Pages (from-to)817-833
Number of pages17
JournalApplied Mathematical Modelling
Volume28
Issue number9
DOIs
StatePublished - Sep 2004

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A language measure for performance evaluation of discrete-event supervisory control systems'. Together they form a unique fingerprint.

Cite this