首页 | 本学科首页   官方微博 | 高级检索  
     

基于Petri网分解技术的自动化物流系统建模分析*
引用本文:侯媛彬,李倩.基于Petri网分解技术的自动化物流系统建模分析*[J].计算机应用研究,2010,27(11):4133-4135.
作者姓名:侯媛彬  李倩
作者单位:西安科技大学,电气与控制工程学院,西安,710054
基金项目:陕西省自然科学基金资助项目(2009Jm8002)
摘    要:针对西安科技大学自动化物流系统的任务规划,提出了一种基于变迁指标和库所指标融合的Petri网分解方法。采用Petri网理论对该物流系统建立模型,给出定义,在此基础上采用提出的Petri网分解方法得到融合了T网和S网特性的最小子网。通过分析该最小子网,得出Petri网模型的活性和有界性,据此推断出物流系统的任务规划合理有效。该方法大大减少了直接分析子网或原Petri网模型的计算量,可避免全局或局部死锁,为系统良好运行提供了依据。

关 键 词:Petri网分解  自动化物流系统  变迁指标    库所指标    活性    有界性

Modeling and analysis of automatic logistics system based on decomposition of Petri nets techniques
HOU Yuan-bin,LI Qian.Modeling and analysis of automatic logistics system based on decomposition of Petri nets techniques[J].Application Research of Computers,2010,27(11):4133-4135.
Authors:HOU Yuan-bin  LI Qian
Affiliation:(1.School of Computer & Electronic Information, Guangxi University, Nanning 530004, China; 2.Dept. of Computer Engineering, Guangxi University of Technology, Liuzhou Guangxi 545006, China)
Abstract:Due to the disadvantages of sensitivity to the initial selection of the medoids and poor performance in large data set processing in the K-medoids clustering algorithm, this paper proposed an improved K-medoids algorithm based on a fine-tuned of initial medoids and an incremental candidate set of medoids. The proposed algorithm optimized initial medoids by fine-tu-ning and reduced computational complexity of medoids substitution through expanding medoids candidate set gradually. Expenrimental results demonstrate the effectiveness of this algorithm,which can improve clustering quality and significantly shorten the time in calculation compared with the traditional K-medoids algorithm.
Keywords:decomposition of Petri net  automated logistics system  index of transition  index of places  activity  boundedness
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号