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 proceedingConference contribution

    3 Citations (Scopus)

    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 languageEnglish (US)
    Title of host publicationProceedings of the 2004 American Control Conference (AAC)
    Pages5120-5125
    Number of pages6
    Volume6
    DOIs
    StatePublished - 2004
    EventProceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States
    Duration: Jun 30 2004Jul 2 2004

    Other

    OtherProceedings of the 2004 American Control Conference (AAC)
    CountryUnited States
    CityBoston, MA
    Period6/30/047/2/04

    Fingerprint

    Formal languages
    Context free grammars
    Finite automata
    Control systems
    Chemical analysis

    All Science Journal Classification (ASJC) codes

    • Control and Systems Engineering

    Cite this

    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) (Vol. 6, pp. 5120-5125) https://doi.org/10.1109/ACC.2004.249127
    Chattopadhyay, Ishanu ; Ray, Asok ; Wang, Xi. / A complex measure of non-regular languages for discrete-event supervisory control. Proceedings of the 2004 American Control Conference (AAC). Vol. 6 2004. pp. 5120-5125
    @inproceedings{8ffc456512614c67afc78447c12281b3,
    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.",
    author = "Ishanu Chattopadhyay and Asok Ray and Xi Wang",
    year = "2004",
    doi = "10.1109/ACC.2004.249127",
    language = "English (US)",
    isbn = "0780383354",
    volume = "6",
    pages = "5120--5125",
    booktitle = "Proceedings of the 2004 American Control Conference (AAC)",

    }

    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). 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

    A complex measure of non-regular languages for discrete-event supervisory control. / Chattopadhyay, Ishanu; Ray, Asok; Wang, Xi.

    Proceedings of the 2004 American Control Conference (AAC). Vol. 6 2004. p. 5120-5125.

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

    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.

    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

    VL - 6

    SP - 5120

    EP - 5125

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

    ER -

    Chattopadhyay I, Ray A, Wang X. A complex measure of non-regular languages for discrete-event supervisory control. In Proceedings of the 2004 American Control Conference (AAC). Vol. 6. 2004. p. 5120-5125 https://doi.org/10.1109/ACC.2004.249127