SML 语义检验的着色Petri 网展开算法
Unfoldings of Colored Petri Nets with SML Semantic Checking
-
摘要: 为解决着色Petri 网(Colored Petri Nets, CPN) 在大型复杂系统工程应用中的结构分析问题, 提出着色Petri 网的展开算法. 在基于Petri 网的命题逻辑表示方法的基础上, 讨论CPN 标准元语言(Standard Meta Language, SML) 的语义解析, 提出了将CPN 转换为普通Petri 网(Ordinary Petri Nets, OPN) 的一般步骤和基于SML 语义检验的展开算法. 列举实例并使用运行支持平台验证该算法高效可行, 利于CPN 模型结构分析方法在复杂工程应用中的推广.Abstract: 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 e ective to to make the CPN strucure analysis widely used in complex engieering models.
下载: