Signed real measure of regular languages

Asok Ray, Xi Wang

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    This chapter 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 a set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior of deterministic finite state automata (DFSA) under different supervisors. In the setting of the language measure, a supervisor's performance is superior if the supervised plant is more likely to terminate at a good marked state and/or less likely to terminate at a bad marked state. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.

    Original languageEnglish (US)
    Title of host publicationQuantitative Measure for Discrete Event Supervisory Control
    PublisherSpringer New York
    Pages3-37
    Number of pages35
    ISBN (Print)0387021086, 9780387021089
    DOIs
    StatePublished - Dec 1 2005

    Fingerprint

    Formal languages
    Supervisory personnel
    Finite automata
    Automata theory
    Computational complexity
    Polynomials

    All Science Journal Classification (ASJC) codes

    • Computer Science(all)

    Cite this

    Ray, A., & Wang, X. (2005). Signed real measure of regular languages. In Quantitative Measure for Discrete Event Supervisory Control (pp. 3-37). Springer New York. https://doi.org/10.1007/0-387-23903-0_1
    Ray, Asok ; Wang, Xi. / Signed real measure of regular languages. Quantitative Measure for Discrete Event Supervisory Control. Springer New York, 2005. pp. 3-37
    @inbook{cbdbdf61e7ef46338a112b54eac20270,
    title = "Signed real measure of regular languages",
    abstract = "This chapter 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 a set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior of deterministic finite state automata (DFSA) under different supervisors. In the setting of the language measure, a supervisor's performance is superior if the supervised plant is more likely to terminate at a good marked state and/or less likely to terminate at a bad marked state. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.",
    author = "Asok Ray and Xi Wang",
    year = "2005",
    month = "12",
    day = "1",
    doi = "10.1007/0-387-23903-0_1",
    language = "English (US)",
    isbn = "0387021086",
    pages = "3--37",
    booktitle = "Quantitative Measure for Discrete Event Supervisory Control",
    publisher = "Springer New York",
    address = "United States",

    }

    Ray, A & Wang, X 2005, Signed real measure of regular languages. in Quantitative Measure for Discrete Event Supervisory Control. Springer New York, pp. 3-37. https://doi.org/10.1007/0-387-23903-0_1

    Signed real measure of regular languages. / Ray, Asok; Wang, Xi.

    Quantitative Measure for Discrete Event Supervisory Control. Springer New York, 2005. p. 3-37.

    Research output: Chapter in Book/Report/Conference proceedingChapter

    TY - CHAP

    T1 - Signed real measure of regular languages

    AU - Ray, Asok

    AU - Wang, Xi

    PY - 2005/12/1

    Y1 - 2005/12/1

    N2 - This chapter 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 a set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior of deterministic finite state automata (DFSA) under different supervisors. In the setting of the language measure, a supervisor's performance is superior if the supervised plant is more likely to terminate at a good marked state and/or less likely to terminate at a bad marked state. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.

    AB - This chapter 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 a set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior of deterministic finite state automata (DFSA) under different supervisors. In the setting of the language measure, a supervisor's performance is superior if the supervised plant is more likely to terminate at a good marked state and/or less likely to terminate at a bad marked state. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.

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

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

    U2 - 10.1007/0-387-23903-0_1

    DO - 10.1007/0-387-23903-0_1

    M3 - Chapter

    SN - 0387021086

    SN - 9780387021089

    SP - 3

    EP - 37

    BT - Quantitative Measure for Discrete Event Supervisory Control

    PB - Springer New York

    ER -

    Ray A, Wang X. Signed real measure of regular languages. In Quantitative Measure for Discrete Event Supervisory Control. Springer New York. 2005. p. 3-37 https://doi.org/10.1007/0-387-23903-0_1