SML语义检验的着色Petri网展开算法  

Unfoldings of Colored Petri Nets with SML Semantic Checking

作　　者：廖晶静 LIAO Jing-Jing(China Shipbuilding Industry Corporation No.722 Research Institute,Wuhan Hubei 430205,China)

机构地区：[1]中国船舶重工集团公司第七二二研究所,湖北武汉430205

出　　处：《指挥与控制学报》2018年第2期170-174,共5页Journal of Command and Control

基　　金：国家自然科学基金(61273207)资助~~

摘　　要：为解决着色Petri网(Colored Petri Nets,CPN)在大型复杂系统工程应用中的结构分析问题,提出着色Petri网的展开算法.在基于Petri网的命题逻辑表示方法的基础上,讨论CPN标准元语言(Standard Meta Language,SML)的语义解析,提出了将CPN转换为普通Petri网(Ordinary Petri Nets,OPN)的一般步骤和基于SML语义检验的展开算法.列举实例并使用运行支持平台验证该算法高效可行,利于CPN模型结构分析方法在复杂工程应用中的推广.In order to solve the Problem of structure analysis for Colored Petri nets(CPN)in large complex system engineering applications,a kind of unfolding approach for CPN is proposed.Based on the proposition logic represented with the Petri Nets,the semantics of the CPN SML(Standard Meta Language)are discussed.After that,the unfolding approach of CPN is proposed including the steps and unfolding algorithm based on the semantics verification.And the approach is exemplified on the programmed operation platform,which approves the approach is feasible and eective to to make the CPN strucure analysis widely used in complex engieering models.

关 键 词：着色PETRI网 标准元语言 产生式规则 检验与展开 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]