On-line identification of language measure parameters for discrete-event supervisory control

Wang, Xi; Ray, Asok; Khatkhate, Amol M

doi:10.1016/j.apm.2004.10.013

Cited by 11 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This report presents a quantitative approach to synthesis of an optimal discreteevent supervisOry (DES) control of a complex engineering system based on the recent theoretical work in this field [WR04] ~W ] [SRO3] [WRK03].…”

Section: Discussionmentioning

confidence: 99%

“…For stationary operation of the engine, since conditional probabilities of the events can be assumed to be time-invariant, the identified event costs and their uncertainty bounds can be determined. Wang et al [WRK03] have reported details of the identification procedure and its experimental validation on a robotic test bed. As a typical case, Figure 7 presents identification of event costs at state 6 (engine operation under normal damage increment).…”

Section: Language Measure Parameter Identifcationmentioning

confidence: 99%

See 1 more Smart Citation

Optimal discrete event supervisory control of aircraft gas turbine engines

Yasar

Ray

2004

Proceedings of the 2004 American Control Conference

View full text Add to dashboard Cite

Abstract'This report presents an application of the recently developed theory of optimal Discrete Event Supervisory (DES) control that is based on a signed real measure of regular languages. The DES control techniques are validated on an aircraft gas turbine engine simulation test bed. The test bed is implemented on a networked computer system in which two computers operate in the client-server mode. Several DES controllers have been tested for engine performance and reliability.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Language Measure Parameter Identifcationmentioning

confidence: 99%

Optimal discrete event supervisory control of aircraft gas turbine engines

Yasar

Ray

2004

Proceedings of the 2004 American Control Conference

View full text Add to dashboard Cite

show abstract

“…In Ray and Phoha (2003), Ray and Surana (2003) and the determination of these parameters merely relies on the designer's perception and no systematic procedure is given for their assignment and identification. More recently, Wang et al (2005) have developed an on-line procedure for identification of the state cost transition matrix parameters of the language measure based on a DFSA model of the physical plant. The recursive algorithm of this identification procedure relies on simulation.…”

Section: Introductionmentioning

confidence: 99%

Analytical approach to evaluate language measure parameters for discrete-event supervisory control

Khatab

Nourelfath

2006

International Journal of Control

View full text Add to dashboard Cite

The discrete-event dynamic behaviour of physical plants is usually represented by regular languages that can be realized as deterministic finite state automata (DFSA). The concept and construction of signed real measure of regular languages have been recently developed in literature. The language measure is assigned two parameters, namely a state transition cost matrix and a state cost vector. This article formulates an analytical approach to determine the language measure parameters. The proposed approach is based on the theory of Markov stochastic processes. The DFSA of the discrete-event dynamic behaviour is first transformed into a Markov chain. Therefore, an event cost is calculated by the occurrence probability of this event in a given state of a discrete-time Markov chain. The determination of the state cost vector is based on the underlying continuous-time Markov chain to evaluate the steady state-state probabilities. Kronecker algebra is used to facilitate the description of large systems, while minimizing memory requirements. It is shown, through a manufacturing example, how the formulated method may provide a systematic way for quantitative evaluation and comparison of the discrete-event dynamic behaviour of the supervised plants.

show abstract

“…where the parameters ρ and q can be identified from the experimental time series data of the system dynamics [8]. The state transition cost matrix (see …”

Section: Examplementioning

confidence: 99%

“…Optimal control of finite state automata has been recently have been reported [5] based on the language measure and formalizes quantitative analysis and synthesis of DES control laws. The approach is state-based and the language measure parameters are identified from physical experiments or simulation on a deterministic finite state automaton (DFSA) model of the plant [8]. However, using memoryless statebased tools for supervisory control synthesis may suffer serious shortcomings if the details of transitions cannot be captured by finitely many states.…”

Section: Introductionmentioning

confidence: 99%

A Complex Measure for Linear Grammars

Chattopadhyay

Ray

2005

Demonstratio Mathematica

Self Cite

View full text Add to dashboard Cite

Abstract. The signed real measure of regular languages, introduced and validated in recent literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). However, this approach relies on memoryless state-based tools for supervisory control synthesis and may become inadequate if the transitions in the plant dynamics cannot be captured by finitely many states. From this perspective, the measure of regular languages needs to be extended to that of non-regular languages, such as Petri nets or other higher level languages in the Chomsky hierarchy. Measures for non-regular languages has not apparently been reported in open literature and is an open area of research. As a step toward achieving this goal, this paper introduces a complex measure of linear context free grammars (LCFG) that belong to the class of non-regular languages. The proposed complex measure becomes equivalent to the signed reed measure, reported in recent literature, if the LCFG is degenerated to a regular grammar. IntroductionFinite state automata (FSA) (equivalently, regular languages) have been widely used to model and synthesize supervisory control laws for discreteevent plants [4] because the task of discrete-event supervisory (DES) control synthesis becomes mathematically tractable and computationally efficient due to simplicity of regular languages. According to the paradigm of DES control, a finite-state automaton (e.g., the discrete-event model of a physical plant) is a language generator whose behavior is constrained by the supervisor to meet a given specification. The (controlled) sublanguage of the plant behavior could be different under different supervisors that satisfy their own respective specifications. Such a partially ordered set of sublanguages re-1991 Mathematics Subject Classification: 93A05.

show abstract

On-line identification of language measure parameters for discrete-event supervisory control

Cited by 11 publications

References 5 publications

Optimal discrete event supervisory control of aircraft gas turbine engines

Optimal discrete event supervisory control of aircraft gas turbine engines

Analytical approach to evaluate language measure parameters for discrete-event supervisory control

A Complex Measure for Linear Grammars

Contact Info

Product

Resources

About