A language measure for performance evaluation of discrete-event supervisory control systems

被引：26

作者：

Wang, X ^{[1
]}

Ray, A ^{[1
]}

机构：

[1] Penn State Univ, Dept Mech Engn, University Pk, PA 16802 USA

来源：

APPLIED MATHEMATICAL MODELLING | 2004年 / 28卷 / 09期

关键词：

discrete-event control; formal languages; performance measure;

D O I：

10.1016/j.apm.2003.12.003

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper 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 any set of partially ordered sublanguages of a regular language for quantitative evaluation of the controlled behavior of a deterministic finite-state automaton (DFSA) plant under different supervisors. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states. (C) 2004 Elsevier Inc. All rights reserved.

引用

页码：817 / 833

页数：17

共 20 条

[1]

[Anonymous], 1995, MODELING CONTROL LOG

[2]

[Anonymous], FORMAL LANGUAGES AUT

[3] Learning deterministic regular grammars from stochastic samples in polynomial time [J].

Carrasco, RC ;

Oncina, J .

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (01) :1-19

[4]

Cassandras C.G., 2021, Introduction to Discrete Event Systems, V3rd

[5]

Fu JB, 2003, 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, P3209

[6]

Fu JB, 2003, P AMER CONTR CONF, P1691

[7]

Fu JB, 2002, IEEE DECIS CONTR P, P799, DOI 10.1109/CDC.2002.1184603

[8]

Hopcroft J.E., 2001, INTRO AUTOMATA THEOR

[9] Control of stochastic discrete event systems modeled by probabilistic languages [J].

Kumar, R ;

Garg, VK .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2001, 46 (04) :593-606

[10] OPTIMAL SUPERVISORY CONTROL OF DISCRETE-EVENT DYNAMICAL-SYSTEMS [J].

KUMAR, R ;

GARG, VK .

SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1995, 33 (02) :419-439

← 1 2 →