Generalized language measure families of probabilistic finite state systems

I. Chattopadhyay; A. Ray

doi:10.1080/00207170601188784

Generalized language measure families of probabilistic finite state systems

Research output: Contribution to journal › Article › peer-review

Abstract

The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis of discrete-event systems. This paper reports generalizations of the language measure, which can serve as performance indices for synthesis of optimal discrete-event supervisory decision and control laws. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples.

Original language	English
Pages (from-to)	789-799
Number of pages	11
Journal	International Journal of Control
Volume	80
Issue number	5
DOIs	https://doi.org/10.1080/00207170601188784
State	Published - May 2007

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications

Access to Document

10.1080/00207170601188784

Cite this

@article{1e8689973eaa4ea3af25d3b665ccc67f,

title = "Generalized language measure families of probabilistic finite state systems",

abstract = "The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis of discrete-event systems. This paper reports generalizations of the language measure, which can serve as performance indices for synthesis of optimal discrete-event supervisory decision and control laws. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples.",

author = "I. Chattopadhyay and A. Ray",

year = "2007",

month = may,

doi = "10.1080/00207170601188784",

language = "English",

volume = "80",

pages = "789--799",

number = "5",

}

TY - JOUR

T1 - Generalized language measure families of probabilistic finite state systems

AU - Chattopadhyay, I.

AU - Ray, A.

PY - 2007/5

Y1 - 2007/5

N2 - The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis of discrete-event systems. This paper reports generalizations of the language measure, which can serve as performance indices for synthesis of optimal discrete-event supervisory decision and control laws. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples.

AB - The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis of discrete-event systems. This paper reports generalizations of the language measure, which can serve as performance indices for synthesis of optimal discrete-event supervisory decision and control laws. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples.

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

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

U2 - 10.1080/00207170601188784

DO - 10.1080/00207170601188784

M3 - Article

AN - SCOPUS:34047205072

SN - 0020-7179

VL - 80

SP - 789

EP - 799

JO - International Journal of Control

JF - International Journal of Control

IS - 5

ER -

Generalized language measure families of probabilistic finite state systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this