A complex measure of non-regular languages for discrete-event supervisory control

Ishanu Chattopadhyay; Asok Ray; Xi Wang

doi:10.1109/ACC.2004.249127

A complex measure of non-regular languages for discrete-event supervisory control

Ishanu Chattopadhyay, Asok Ray, Xi Wang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

The measure of regular languages, recently introduced in technical literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalentiy, regular languages). This paper extends the signed real measure of regular languages, to a complex measure of non-regular languages, generated by linear context free grammars; the concept is illustrated by an example. The complex measure becomes equivalent to the signed real measure if the linear context free grammar is degenerated to a regular grammar.

Original language	English
Title of host publication	Proceedings of the 2004 American Control Conference (AAC)
Pages	5120-5125
Number of pages	6
DOIs	https://doi.org/10.1109/ACC.2004.249127
State	Published - 2004
Event	Proceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States Duration: Jun 30 2004 → Jul 2 2004

Publication series

Name	Proceedings of the American Control Conference
Volume	6
ISSN (Print)	0743-1619

Conference

Conference	Proceedings of the 2004 American Control Conference (AAC)
Country/Territory	United States
City	Boston, MA
Period	6/30/04 → 7/2/04

Keywords

Discrete Event Supervisory Control
Language Measure
Linear Grammars

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/ACC.2004.249127

Cite this

@inproceedings{144a7b1b17814aa2ac59f3a9f28d4ec2,

title = "A complex measure of non-regular languages for discrete-event supervisory control",

abstract = "The measure of regular languages, recently introduced in technical literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalentiy, regular languages). This paper extends the signed real measure of regular languages, to a complex measure of non-regular languages, generated by linear context free grammars; the concept is illustrated by an example. The complex measure becomes equivalent to the signed real measure if the linear context free grammar is degenerated to a regular grammar.",

keywords = "Discrete Event Supervisory Control, Language Measure, Linear Grammars",

author = "Ishanu Chattopadhyay and Asok Ray and Xi Wang",

year = "2004",

doi = "10.1109/ACC.2004.249127",

language = "English",

isbn = "0780383354",

series = "Proceedings of the American Control Conference",

pages = "5120--5125",

booktitle = "Proceedings of the 2004 American Control Conference (AAC)",

note = "Proceedings of the 2004 American Control Conference (AAC) ; Conference date: 30-06-2004 Through 02-07-2004",

}

Chattopadhyay, I, Ray, A & Wang, X 2004, A complex measure of non-regular languages for discrete-event supervisory control. in Proceedings of the 2004 American Control Conference (AAC). Proceedings of the American Control Conference, vol. 6, pp. 5120-5125, Proceedings of the 2004 American Control Conference (AAC), Boston, MA, United States, 6/30/04. https://doi.org/10.1109/ACC.2004.249127

TY - GEN

T1 - A complex measure of non-regular languages for discrete-event supervisory control

AU - Chattopadhyay, Ishanu

AU - Ray, Asok

AU - Wang, Xi

PY - 2004

Y1 - 2004

N2 - The measure of regular languages, recently introduced in technical literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalentiy, regular languages). This paper extends the signed real measure of regular languages, to a complex measure of non-regular languages, generated by linear context free grammars; the concept is illustrated by an example. The complex measure becomes equivalent to the signed real measure if the linear context free grammar is degenerated to a regular grammar.

AB - The measure of regular languages, recently introduced in technical literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalentiy, regular languages). This paper extends the signed real measure of regular languages, to a complex measure of non-regular languages, generated by linear context free grammars; the concept is illustrated by an example. The complex measure becomes equivalent to the signed real measure if the linear context free grammar is degenerated to a regular grammar.

KW - Discrete Event Supervisory Control

KW - Language Measure

KW - Linear Grammars

UR - http://www.scopus.com/inward/record.url?scp=7544230632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7544230632&partnerID=8YFLogxK

U2 - 10.1109/ACC.2004.249127

DO - 10.1109/ACC.2004.249127

M3 - Conference contribution

AN - SCOPUS:7544230632

SN - 0780383354

T3 - Proceedings of the American Control Conference

SP - 5120

EP - 5125

BT - Proceedings of the 2004 American Control Conference (AAC)

T2 - Proceedings of the 2004 American Control Conference (AAC)

Y2 - 30 June 2004 through 2 July 2004

ER -

A complex measure of non-regular languages for discrete-event supervisory control

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this