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

Producción científica: Article › revisión exhaustiva

Resumen

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.

Idioma original	English
Páginas (desde-hasta)	789-799
Número de páginas	11
Publicación	International Journal of Control
Volumen	80
N.º	5
DOI	https://doi.org/10.1080/00207170601188784
Estado	Published - may 2007

Financiación

This work has been supported in part by the U.S. Army Research laboratory and the U.S. Army Research Office

Financiadores	Número del financiador
U.S. Army Research Office
Army Research Laboratory

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications

Acceder al documento

10.1080/00207170601188784

Otros archivos y enlaces

Citar esto

@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

Resumen

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto