Signed Real Measure of Regular Languages

Amit Surana, Asok Ray

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

4 Scopus citations

Abstract

This paper reviews and extends the recent work on signed real measure of regular languages for discrete-event supervisory control within a unified framework. The language measure provides total ordering of any set of partially ordered sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The paper presents a procedure by which performance of different supervisors can be evaluated based on a common quantitative tool. Two algorithms are discussed for computation of the language measure. A physical interpretation of the language measure is given from the perspective of discreteevent supervisory control synthesis.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Pages3233-3238
Number of pages6
DOIs
StatePublished - 2003
Event42nd IEEE Conference on Decision and Control - Maui, HI, United States
Duration: Dec 9 2003Dec 12 2003

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume4
ISSN (Print)0191-2216

Other

Other42nd IEEE Conference on Decision and Control
CountryUnited States
CityMaui, HI
Period12/9/0312/12/03

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Signed Real Measure of Regular Languages'. Together they form a unique fingerprint.

Cite this