无标注L型Petri网语言属性判定的一种方法
发布时间：2019-06-29 20:30
【摘要】：Petri网和自动机是离散事件动态系统建模的两种重要方法,研究这两种模型之间的关系,对于更好地理解和控制离散事件动态系统的行为具有重要作用.本文从形式语言的角度对该问题进行了研究,提出了判定无标注L型Petri网语言属性的方法,引入有效递增子和线性子等概念来刻画Petri网语言的性质.对于一个Petri网PN,当PN没有有效递增子时,PN对应的Petri网语言是正则语言.当PN的某个有效递增子有两个及其以上线性子时,PN对应的Petri网语言是上下文有关的.当PN的所有有效递增子只有一个线性子时,如果只有一个有效递增子,则PN对应的Petri网语言是上下文无关的;如果PN有两个及其以上有效递增子,则顺序引发、嵌套引发和选择引发时PN对应的Petri网语言是上下文无关的,并发引发和交叉引发时PN对应的Petri网语言是上下文相关的.本文还对可达树进行了改进,给出了利用改进后的可达树来判定有效递增子的方法,从而使得本文给出的判定无标注L型Petri网语言属性的方法具有可操作性.
[Abstract]:Petri net and automaton are two important methods for modeling discrete event dynamic systems. The study of the relationship between the two models plays an important role in better understanding and controlling the behavior of discrete event dynamic systems. In this paper, the problem is studied from the point of view of formal language, and a method to determine the linguistic attributes of unmarked L-type Petri net is proposed. The concepts of effective iterator and linear sub-are introduced to characterize the properties of Petri net language. For a Petri net PN, the Petri net language corresponding to PN is regular when PN does not have an effective iterator. When a valid iterator of PN has two or more linear children, the Petri net language corresponding to PN is context-dependent. When all valid implicators of PN have only one linear child, the Petri net language corresponding to PN is context-free if there is only one valid adopter, and if PN has two or more valid implicators, then the Petri net language corresponding to PN is context-free when nesting and selection is raised, and the Petri net language corresponding to PN is context-dependent when concurrent initiation and cross-initiation. In this paper, the reachability tree is also improved, and the method of using the improved reachability tree to determine the effective enhancer is given, which makes the method given in this paper operable to determine the language attributes of unmarked L-type Petri net.
【作者单位】： 华北科技学院计算机系;河北省物联网数据采集与处理工程技术研究中心;
【基金】：国家自然科学基金(批准号:61472137) 中央高校基本科研业务项目(批准号:3142014007,3142015022) 河北省高等学校科学技术研究项目(批准号:Z2014038) 青海省重点研发项目(批准号:2016-SF-130)资助
【分类号】：TP301.1
本文编号：2508093
[Abstract]:Petri net and automaton are two important methods for modeling discrete event dynamic systems. The study of the relationship between the two models plays an important role in better understanding and controlling the behavior of discrete event dynamic systems. In this paper, the problem is studied from the point of view of formal language, and a method to determine the linguistic attributes of unmarked L-type Petri net is proposed. The concepts of effective iterator and linear sub-are introduced to characterize the properties of Petri net language. For a Petri net PN, the Petri net language corresponding to PN is regular when PN does not have an effective iterator. When a valid iterator of PN has two or more linear children, the Petri net language corresponding to PN is context-dependent. When all valid implicators of PN have only one linear child, the Petri net language corresponding to PN is context-free if there is only one valid adopter, and if PN has two or more valid implicators, then the Petri net language corresponding to PN is context-free when nesting and selection is raised, and the Petri net language corresponding to PN is context-dependent when concurrent initiation and cross-initiation. In this paper, the reachability tree is also improved, and the method of using the improved reachability tree to determine the effective enhancer is given, which makes the method given in this paper operable to determine the language attributes of unmarked L-type Petri net.
【作者单位】： 华北科技学院计算机系;河北省物联网数据采集与处理工程技术研究中心;
【基金】：国家自然科学基金(批准号:61472137) 中央高校基本科研业务项目(批准号:3142014007,3142015022) 河北省高等学校科学技术研究项目(批准号:Z2014038) 青海省重点研发项目(批准号:2016-SF-130)资助
【分类号】：TP301.1
【相似文献】
相关期刊论文 前10条
1 张继军;董卫;范昊;;Petri网与二元文法的语言等价性[J];微电子学与计算机;2011年04期
2 王斌国;;Petri网分析方法综述[J];福建电脑;2007年10期
3 李静;娄志刚;;基于Petri网的分析方法简述[J];企业技术开发;2011年14期
4 曾庆田,吴哲辉;基于分解的结构复杂Petri网的语言行为描述[J];系统工程学报;2004年03期
5 丁志军,蒋昌俊;基于网语言的Ada程序局部性质的分析和验证[J];软件学报;2002年12期
6 曾庆田;吴哲辉;;类S-图的语言性质分析[J];计算机科学;2002年05期
7 胡健生,黄金志,祝习兵,黄勇;基于Petri网语言的程序设计流程[J];信号处理;2003年05期
8 曾庆田;Petri网语言的同步混排运算及在语言分析中的应用[J];系统工程学报;2005年05期
9 刘关俊;蒋昌俊;陈黎静;;各类Petri网语言间的关系[J];系统仿真学报;2007年07期
10 陈军;王元元;;Petri网语言与传统形式语言的关系[J];计算机科学;1996年06期
，本文编号：2508093
本文链接：https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2508093.html
