無標注L型Petri網(wǎng)語言屬性判定的一種方法
發(fā)布時間：2019-06-29 20:30
【摘要】：Petri網(wǎng)和自動機是離散事件動態(tài)系統(tǒng)建模的兩種重要方法,研究這兩種模型之間的關系,對于更好地理解和控制離散事件動態(tài)系統(tǒng)的行為具有重要作用.本文從形式語言的角度對該問題進行了研究,提出了判定無標注L型Petri網(wǎng)語言屬性的方法,引入有效遞增子和線性子等概念來刻畫Petri網(wǎng)語言的性質.對于一個Petri網(wǎng)PN,當PN沒有有效遞增子時,PN對應的Petri網(wǎng)語言是正則語言.當PN的某個有效遞增子有兩個及其以上線性子時,PN對應的Petri網(wǎng)語言是上下文有關的.當PN的所有有效遞增子只有一個線性子時,如果只有一個有效遞增子,則PN對應的Petri網(wǎng)語言是上下文無關的;如果PN有兩個及其以上有效遞增子,則順序引發(fā)、嵌套引發(fā)和選擇引發(fā)時PN對應的Petri網(wǎng)語言是上下文無關的,并發(fā)引發(fā)和交叉引發(fā)時PN對應的Petri網(wǎng)語言是上下文相關的.本文還對可達樹進行了改進,給出了利用改進后的可達樹來判定有效遞增子的方法,從而使得本文給出的判定無標注L型Petri網(wǎng)語言屬性的方法具有可操作性.
[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.
【作者單位】： 華北科技學院計算機系;河北省物聯(lián)網(wǎng)數(shù)據(jù)采集與處理工程技術研究中心;
【基金】：國家自然科學基金(批準號:61472137) 中央高�；究蒲袠I(yè)務項目(批準號:3142014007,3142015022) 河北省高等學校科學技術研究項目(批準號:Z2014038) 青海省重點研發(fā)項目(批準號: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.
【作者單位】： 華北科技學院計算機系;河北省物聯(lián)網(wǎng)數(shù)據(jù)采集與處理工程技術研究中心;
【基金】：國家自然科學基金(批準號:61472137) 中央高�；究蒲袠I(yè)務項目(批準號:3142014007,3142015022) 河北省高等學校科學技術研究項目(批準號:Z2014038) 青海省重點研發(fā)項目(批準號:2016-SF-130)資助
【分類號】：TP301.1
【相似文獻】
相關期刊論文 前10條
1 張繼軍;董衛(wèi);范昊;;Petri網(wǎng)與二元文法的語言等價性[J];微電子學與計算機;2011年04期
2 王斌國;;Petri網(wǎng)分析方法綜述[J];福建電腦;2007年10期
3 李靜;婁志剛;;基于Petri網(wǎng)的分析方法簡述[J];企業(yè)技術開發(fā);2011年14期
4 曾慶田,吳哲輝;基于分解的結構復雜Petri網(wǎng)的語言行為描述[J];系統(tǒng)工程學報;2004年03期
5 丁志軍,蔣昌俊;基于網(wǎng)語言的Ada程序局部性質的分析和驗證[J];軟件學報;2002年12期
6 曾慶田;吳哲輝;;類S-圖的語言性質分析[J];計算機科學;2002年05期
7 胡健生,黃金志,祝習兵,黃勇;基于Petri網(wǎng)語言的程序設計流程[J];信號處理;2003年05期
8 曾慶田;Petri網(wǎng)語言的同步混排運算及在語言分析中的應用[J];系統(tǒng)工程學報;2005年05期
9 劉關俊;蔣昌俊;陳黎靜;;各類Petri網(wǎng)語言間的關系[J];系統(tǒng)仿真學報;2007年07期
10 陳軍;王元元;;Petri網(wǎng)語言與傳統(tǒng)形式語言的關系[J];計算機科學;1996年06期
，本文編號：2508093
本文鏈接：http://www.sikaile.net/kejilunwen/ruanjiangongchenglunwen/2508093.html
最近更新
教材專著
