請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/30568
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 顏嗣鈞 | |
dc.contributor.author | Wen-Hung Tseng | en |
dc.contributor.author | 曾文鴻 | zh_TW |
dc.date.accessioned | 2021-06-13T02:09:03Z | - |
dc.date.available | 2007-07-27 | |
dc.date.copyright | 2007-07-27 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-06-28 | |
dc.identifier.citation | [1]P. J. Ramadge and W. M. Wonham, “Supervisory control of a class of discrete event processes,” SIAM Journal of Control and Optimization, vol.25, pp. 206-230, 1987.
[2]M.Lawford and W.M. Wonham, “Supervisory control of probabilistic discrete event systems,” In Proceedings of 36th Midwest symposium on Circuit and Systems, pp. 327-331, 1993. [3]S. Lawford and E.Chen, “The infimal closed and controllable superlanguage and Its Application in Supervisory Control,” IEEE Transactions on Automatic Control, vol.35, pp.398-404, 1990. [4]V.K. Garg, R.Kumar, “Control of Stochastic Discrete Event Systems Modeled by Probabilistic Languages,” In IEEE Transactions on Automatic Control, Vol. 46, pp. 593-606, 2001. [5]P.J. Ramadge and W.M. Wonham, “The control of discrete event systems,” Proceedings of IEEE:Special Issue on Discrete Event Systems, vol.77, pp.81-98, 1989. [6] P.J. Ramadge and W.M. Wonham, “On the supremal controllable sublanguage of a given language,” SIAM Journal of Control and Optimization, vol.25, pp.637-659, 1987. [7]P.J. Ramadge, “Some tractable supervisory control problems for discrete-event systems modeled by Büchi automata,” IEEE Transactions on Automatic Control, vol.34, pp.10-19, 1989. [8]D.E. Muller. “Infinite sequences and finite machines,” In Switching Circuit Theory and Logical Design:Proceedings 4th Annual symposium, pp.3-16, 1963. [9]C. Cortes, M. Mohri, and A. Rastogi “On the Computation of Some Standard Distance between Probabilistic Automata,” In Proceedings of the 11th International Conference on Implementation and Application of Automata(CIAA 2006), vol. 4094 of Lecture Notes in Computer Science, pp.137-149, Taipei, Taiwan Aug. 2006. [10]J.G. Thistle and W.M. Wonham, “Control of infinite behaviour of finite automata,” SIAM Journal of Control and Optimization, vol.32, pp.1075-1097, 1994. [11]V.K. Garg, R. Kumar, S.I. Marcus, “Probabilistic Language Framework for Stochastic Discrete Event Systems,” In IEEE Transactions on Automatic Control, vol.46, No.4, pp.593-606, 2001. [12]S. Hart, M. Sharir, and A, Pnueli, “Termination of Probabilistic Concurrent Program,” In TOPLAS, vol.5, No.3, pp.356-380, 1983. [13]R. McNaughton, “Testing and generating infinite sequences by a finite automaton,” In Information and control, vol.9, pp.521-530, 1966. [14]M.O. Rabin, “Probabilistic automata,” In Inform. And Contr., vol.6, pp.230-245, 1963. [15]S. Eilenberg, Automata,Languages, and Machines, vol.A, New York, Academic, 1974 [16]J.R. Büchi, “On a decision method in restricted second order arithmetic,” In Int. Congress Logic Methodol. Phil. Sci., Stanford, CA, 1960. [17]F. Lin and W.M. Wonham, “Decentralized supervisory control of discrete-event systems,” Inform. Sci., vol.44, pp.199-224, 1988. [18]D. Perrin, “An introduction to finite automata on infinite words,” Automata on Infinite Words, Ecole de Printemps d’Informaatique Theoretique, Le Mont Dore, May 1984(Lecture Notes in Control and Information Sciences, vol.192),pp.2-17, 1981. [19]C.G. Cassandras and S. Lafortune, “Introduction to Discrete Event Systems,” Norwell, MA:Kluwer, 1999. [20]V.K. Garg, R. Kumar, S.I. Marcus, “A Probabilistic Language Formalism for Stochastic Discrete Event Systems,” In IEEE Transactions on Automatic Control, vol.44, No.2, pp.280-293, 1999. [21]S.D. Young, D. Spanjol, V.K. Garg, “Control of Discrete Event Systems Modeled with Deterministic Büchi automata,” In Proceedings American Control Conference, pp.2814-2818, 1992. [22]W.M. Wonham and P.J. Ramadge, “Modular supervisor control of discrete-event systems,” Mathematics of Control, Signals, and Systems, vol.1, No.1, pp.13-30, 1988. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/30568 | - |
dc.description.abstract | 離散事件系統是一個動態的系統,在這個系統中的每一個狀態下,可能會有許多事件會發生,離散事件系統常被派屈網路或是不同的自動機來描述,而在這篇論文中會使用布基自動機來描述離散事件系統。通常在離散事件系統上我們都會加上一個控制器,它的作用是控制在每一狀態下的每一個事件,使其可以被執行或是不可被執行。一些典型在控制上會討論的議題包含了:這個被控制器控制的系統,是否會造成這個系統無法運作,或是會讓整個系統變成不具控制性。以及如果這個控制之下的系統是不具控制性的,要如何找到一個比這個被控制的系統小,但是被控制器控制之後,卻又成為了可控制性的系統,而且這個找到的新系統要是最大的。以及要如何找到一個比這個被控制的系統還要大,但是被控制器控制之後,卻又成為了可控制性的系統,而且這個找到的新系統要是最小的。
在現實生活中的許多系統經常都是含有機率的,因此在此論文中,我們會運用布基自動機來探討機率性的離散事件系統。首先會把機率性的離散事件系統的行為限制在有限長度的事件底下。接著討論一些上述的問題,並找到其解決方法,之後會證明在一些充分及必要的條件之下,這些解決方法的正確性。在此篇論文的第二部分,同樣地,會運用布基自動機來探討機率性的離散事件系統,不過卻會把此系統的行為推廣到無限多個事件發生的情形。接著同樣討論一些無限行為上產生的問題,並找到其解決方法,之後會證明在一些充分及必要的條件之下,這些在無限行為的解決方法的正確性。 本篇論文的貢獻有:我們使用 L∞-準則來測量二個機率性語言的之間距離,而機率性語言包含了有限長度字串的語言和無限長度字串的語言。我們提出如何去計算無限長度字串的機率。我們也提出如果給定一個具有有限長度或是無限長度的語言,該如何去找到一個比這個語言大的最小語言,同時又是可被控制的;以及該如何去找到一個比這個語言小的最大語言。我們同時也使用機率性的控制器來縮短用L∞量測二個機率性語言下所產生的距離。 | zh_TW |
dc.description.abstract | A discrete-event system is a dynamic system in which a state change takes place according to the events.Discrete-event systems are usually modeled by various automata as well as Petri nets. In this thesis, discrete-event systems will be modeled by Büchi automata. A supervisor for a discrete-event system is a controller that can enable or disable each event in each state of the system. Some typical controllability issues of discrete–event systems include: Is a discrete-event system controllable by a supervisor? If the controlled discrete-event system is not controllable, does there exist a smaller discrete-event system which is controllable when supervised by the controller? Moreover, how to find the new discrete-event system? On the other hand, does there exist a larger discrete-event system which is controllable when supervised by the controller? How to find the new larger discrete-event system?
In the real life many systems are of probabilistic nature. In this thesis, we discuss some supervisory control problems of probabilistic discrete-event systems which are modeled by Büchi automata. In the first part, we restrict the behavior of a discrete-event system to be of finite length. Further, we prove the necessary and sufficient conditions for the supervisory control problem on probabilistic discrete-event systems. In the second part of the thesis, we discuss the infinite behaviors of probabilistic discrete-event systems. Then, we extend the controller to probabilistic controller and also prove the problems on infinite behavior. The contributions of this thesis include: we have used the L∞-norm to measure the distance between two probabilistic languages of finite length and infinite length. Moreover, we have given the computation of probabilistic languages of infinite length. We have presented how to find the supremal controllable sublanguage and the infimal closed controllable superlanguage if given a language of finite length or infinite length. We have also used the probabilistic supervisor to reduce the L∞ distance between two probabilistic languages. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T02:09:03Z (GMT). No. of bitstreams: 1 ntu-96-R94921084-1.pdf: 881554 bytes, checksum: fb73dc63ee9339fc33aa07c2d762c9bb (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | Acknowledgement.....................................i
Abstract (Chinese)..................................ii Abstract (English)..................................iv Contents............................................vi List of Figures....................................vii Chapter 1 Introduction..............................1 Chapter 2 Preliminaries.............................6 Section 2.1 Some Terminology and Notation............6 Section 2.2 Probabilistic Discrete Event Systems.....9 2.2.1 Probabilistic Generators.......................9 2.2.2 Probabilistic Languages.......................10 2.2.3 Supervisors...................................14 Section 2.3 Distance for Two Probabilistic Discrete Event Systems.............................................15 Chapter 3 Supervisory Control of Probabilistic Discrete Event Systems Modeled with Finite Strings...........17 Section 3.1 Controllability.........................17 Section 3.2 Supremal Controllable Sublanguages......20 Section 3.3 Infimal Prefix Closed Controllable Superlanguages......................................24 Section 3.4 Probabilistic Supervisor for Discrete Event Systems.............................................28 Chapter 4 Supervisory Control of Probabilistic Discrete Event Systems Modeled with Infinite Strings.........33 Section 4.1 Related Works...........................33 Section 4.2 Controllability.........................35 Section 4.3 Supremal Controllable ω-languages.......39 Section 4.4 Infimal Controllable ω-languages ........43 Chapter 5 Conclusions and Future Works..............50 References..........................................52 | |
dc.language.iso | en | |
dc.title | 利用L∞測量機率性離散事件系統之可控制性 | zh_TW |
dc.title | Using L∞ Norm to Measure Controllability of Probabilistic Discrete Event Systems | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 郭斯彥,莊仁輝,雷欽隆,黃秋煌 | |
dc.subject.keyword | 離散事件系統,控制理論, | zh_TW |
dc.subject.keyword | Discrete Event Systems,DES,Control Theory, | en |
dc.relation.page | 55 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-06-29 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 860.89 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。