A Language Measure for Supervisory Control

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

This paper formulates a signed real measure for sublanguages of regular languages based on the principles of automata theory and real analysis. The measure provides total ordering on the controlled behavior of a finite-state automaton plant under different supervisors. Total variation of the measure serves as a metric for the infinite-dimensional vector space of the sublanguages of a regular language over the finite field GF(2). The computational complexity of the language measure is of polynomial order in the number of plant states.

Original languageEnglish (US)
Pages (from-to)985-991
Number of pages7
JournalApplied Mathematics Letters
Volume16
Issue number7
DOIs
StatePublished - Jan 1 2003

Fingerprint

Supervisory Control
Formal languages
Automata theory
Regular Languages
Supervisory personnel
Finite automata
Vector spaces
Computational complexity
Polynomials
Total ordering
Automata Theory
Finite State Automata
Total Variation
Signed
Vector space
Galois field
Computational Complexity
Metric
Polynomial
Language

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Cite this

@article{273ad011565d4d15969e4bf2833c8c13,
title = "A Language Measure for Supervisory Control",
abstract = "This paper formulates a signed real measure for sublanguages of regular languages based on the principles of automata theory and real analysis. The measure provides total ordering on the controlled behavior of a finite-state automaton plant under different supervisors. Total variation of the measure serves as a metric for the infinite-dimensional vector space of the sublanguages of a regular language over the finite field GF(2). The computational complexity of the language measure is of polynomial order in the number of plant states.",
author = "Asok Ray and A. Surana and Shashi Phoha",
year = "2003",
month = "1",
day = "1",
doi = "10.1016/S0893-9659(03)90084-X",
language = "English (US)",
volume = "16",
pages = "985--991",
journal = "Applied Mathematics Letters",
issn = "0893-9659",
publisher = "Elsevier Limited",
number = "7",

}

A Language Measure for Supervisory Control. / Ray, Asok; Surana, A.; Phoha, Shashi.

In: Applied Mathematics Letters, Vol. 16, No. 7, 01.01.2003, p. 985-991.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Language Measure for Supervisory Control

AU - Ray, Asok

AU - Surana, A.

AU - Phoha, Shashi

PY - 2003/1/1

Y1 - 2003/1/1

N2 - This paper formulates a signed real measure for sublanguages of regular languages based on the principles of automata theory and real analysis. The measure provides total ordering on the controlled behavior of a finite-state automaton plant under different supervisors. Total variation of the measure serves as a metric for the infinite-dimensional vector space of the sublanguages of a regular language over the finite field GF(2). The computational complexity of the language measure is of polynomial order in the number of plant states.

AB - This paper formulates a signed real measure for sublanguages of regular languages based on the principles of automata theory and real analysis. The measure provides total ordering on the controlled behavior of a finite-state automaton plant under different supervisors. Total variation of the measure serves as a metric for the infinite-dimensional vector space of the sublanguages of a regular language over the finite field GF(2). The computational complexity of the language measure is of polynomial order in the number of plant states.

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

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

U2 - 10.1016/S0893-9659(03)90084-X

DO - 10.1016/S0893-9659(03)90084-X

M3 - Article

VL - 16

SP - 985

EP - 991

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

SN - 0893-9659

IS - 7

ER -