Signed real measure of regular languages

被引：0
|
作者：
Surana, A [1 ]
Ray, A [1 ]
机构：
[1] Penn State Univ, University Pk, PA 16802 USA
来源：
42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS | 2003年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper reviews and extends the recent work on signed real measure of regular languages for discrete-event supervisory control within a unified framework. The language measure provides total ordering of any set of partially ordered sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The paper presents a procedure by which performance of different supervisors can be evaluated based on a common quantitative tool. Two algorithms are discussed for computation of the language measure. A physical interpretation of the language measure is given from the perspective of discrete-event supervisory control synthesis.
引用
收藏
页码：3233 / 3238
页数：6
相关论文
共 50 条
  • [21] On Languages Generated by Signed Grammars
    Egccioglu, Omer
    Nagy, Benedek
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, 388 : 28 - 37
  • [22] Rethinking 'classifiers' in signed languages
    Schembri, A
    PERSPECTIVES ON CLASSIFIER CONSTRUCTIONS IN SIGN LANGUAGES, 2003, : 3 - 34
  • [23] On strongly regular signed graphs
    Stanic, Zoran
    DISCRETE APPLIED MATHEMATICS, 2019, 271 : 184 - 190
  • [24] Signed domination in regular graphs
    LRI, URA 410 CNRS, Université de Paris-Sud, 91405 Orsay Cedex, France
    Discrete Math, 1-3 (287-293):
  • [25] Signed domination in regular graphs
    Favaron, O
    DISCRETE MATHEMATICS, 1996, 158 (1-3) : 287 - 293
  • [26] Embedding of signed regular graphs
    Sinha, Deepa
    Rao, Anita Kumari
    NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS, 2018, 24 (03) : 131 - 141
  • [27] Net regular signed trees
    Michael, Isaac B.
    Sepanski, Mark R.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016, 66 : 192 - 204
  • [28] : a robot path planning algorithm based on renormalised measure of probabilistic regular languages
    Chattopadhyay, Ishanu
    Mallapragada, Goutham
    Ray, Asok
    INTERNATIONAL JOURNAL OF CONTROL, 2009, 82 (05) : 849 - 867
  • [29] Regular patterns, regular languages and context-free languages
    Jain, Sanjay
    Ong, Yuh Shin
    Stephan, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1114 - 1119
  • [30] A Real time Implementable All-Pair Dynamic Planning Algorithm for Robot Navigation Based on the Renormalized Measure of Probabilistic Regular Languages
    Lu, Wei
    Chattopadhyay, Ishanu
    Mallapragada, Goutham
    Ray, Asok
    2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 5174 - 5179
12345