Journal of Guangxi Normal University(Natural Science Edition) ›› 2011, Vol. 29 ›› Issue (2): 138-144.

Previous Articles     Next Articles

Model of Controllable Transition System

XU Dao-yun, WANG Xiao-feng   

  1. College of Computer Science and Information,Guizhou University,Guiyang Guizhou 550025,China
  • Received:2011-04-20 Published:2018-11-19

Abstract: A model of controllable transition system is presented based on the frame of nondeterministic labeled transition systems.In the model,the outputs associated with the inner states are viewed as observable information,and the feedback controls of the system are depended on historic records of observations of fixed length.The cycles of running in the system consist of inner running states,outer observations and feedback controls.Furthermore,the related properties in the system can be further studied based on the nondeterministic transition systems with probabilities or fuzzy theories,and the optimization of implementing system can be done by bisimulation of states equivalence.

Key words: controllable transition system, modeling, analysis ofproperties, bisimulation, system optimization

CLC Number: 

  • TP301
[1] 杜尚丰,孙明,董乔雪.智能控制理论与应用[M].北京:中国农业大学出版社,2005.
[2] 杨文.模糊离散事件系统监督控制理论[J].自动化学报,2008,34(4):460-465.
[3] 叶阳东,贾利民.模糊离散事件动态系统相关问题的研究[J].中国铁道科学,2001,22(6):44-49.
[4] CASSANDRAS C G,LAFORTUNE S.Introduction to discrete event systems[M].Norwell,MA:Kluwer,1999.
[5] RAMADGE R J,WONHAM W M.Supervisory control of a class of discreteevent processes[J].SIAM Journal on Control and Optimization,1987,25(1):206-230.
[6] HEYMANN M,LIN F.Discrete-event control of nondeterministic systems[J].IEEE Transactions on Automatic Control,1998,43(1):3-17.
[7] HOPCROFT J E,MOTWANI R,ULLMAN J D.Introduction to automata theory,language,and computation[M].2nd ed.Boston,MA:Addison Wesley,2001.
[8] 贺伟.范畴论[M].北京:科学出版社,2006.
[9] LARSEN K G,SKOU A.Bisimulation through probabilistic testing[J].Information and Computation,1999,94(1):1-28.
[10] RUTTEN J.Universal coalgebra,a theory of systems[J].TheoreticalComputer Science,2000,249(1):3-80.
[11] MOSS L.Coalgebraic logic[J].Annals of Pure and Applied Logic,1999,96(1/3):277-317.
[12] 陆钟万.面向计算机科学的数理逻辑[M].2版.北京:科学出版社,2007.
[13] MITCHELL T M.机器学习[M].曾华军,译.北京:机械工业出版社,2003.
[14] ACZEL P,MENDLER N.A final coalgebra theorem[J].Computer Science,1989,389(1):357-365.
[15] RUTTEN J.Automata and coinduction (an exercise in coalgebra)[J].Computer Science,1998,1466(1):547-554.
[1] XIAO Yiqun, SONG Shuxiang, XIA Haiying. Fast Pedestrian Detection Method Based on Multi-Features    and Implementation [J]. Journal of Guangxi Normal University(Natural Science Edition), 2019, 37(4): 61-67.
[2] LI Zhi, PANG Liu, LIU Guo-yuan, YANG Zhi-shang. A Model-Driven Software Requirements Analysis Method and Its Technical Support [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(2): 19-26.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!