Generalized language measure of finite state logical systems

Ishanu Chattopadhyay, Asok Ray

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The signed, real measure of regular languages has been introduced and validated in recent literature for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems. This paper reports several generalizations of the language measure, which are applicable to synthesis of optimal discrete event supervisory control. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples.

Original languageEnglish (US)
Title of host publicationProceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006
PublisherIEEE Computer Society
Pages366-371
Number of pages6
ISBN (Print)1424400538, 9781424400539
DOIs
StatePublished - Jan 1 2006
Event8th International Workshop on Discrete Event Systems, WODES 2006 - Ann Arbor, MI, United States
Duration: Jul 10 2006Jul 12 2006

Publication series

NameProceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006

Other

Other8th International Workshop on Discrete Event Systems, WODES 2006
CountryUnited States
CityAnn Arbor, MI
Period7/10/067/12/06

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Control and Systems Engineering

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

  • Cite this

    Chattopadhyay, I., & Ray, A. (2006). Generalized language measure of finite state logical systems. In Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006 (pp. 366-371). (Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006). IEEE Computer Society. https://doi.org/10.1109/wodes.2006.382395