查詢結果分析
來源資料
相關文獻
- X Window Implementation of an Algorithm to Synthesize Ordinary Petri Nets
- Genetic Algorithm Approach for Designing Fir Hilbert Transformers and Differentiators
- Parameterized 2D Graphic Compositions
- 考慮執行與延遲時間兩績效下自動倉儲系統動態存取法則之研究
- 違法收集證據之排除法則
- 傳真手寫數字自動辨識系統
- 刑事舉證責任理論--由英美法理論出發
- 厭氧好氧活性污泥法同時除磷及抑制膨化之程序設計
- 活性碳阻燃劑在難燃接著劑上的應用
- Optimal Thermal Unit Commitment in Power System Operation Planning
頁籤選單縮合
題名 | X Window Implementation of an Algorithm to Synthesize Ordinary Petri Nets |
---|---|
作 者 | 趙玉; | 書刊名 | 國立政治大學學報 |
卷期 | 73(下) 民85.10 |
頁次 | 頁451-496 |
分類號 | 310.15 |
關鍵詞 | 派翠圖; 平行系統; 自動製造系統; 活性; 有限性; 死結; 合成; 程序; 區域平行集; 區域互斥集; 結構關係; 時間矩陣; 演算法; 法則; X視窗; 電腦輔助工具; Petri net; Concurrent system; Automated manufacturing system; Liveness; Boundedness; Deadlock; Synthesis; Processes; Local concurrent set; Local exclusive set; Structural relationship; Temporal matrix; Algorithm; Rules; X-window; CAD tool; |
語文 | 英文(English) |
中文摘要 | 平行系統之證明極為複雜,合成法用不著驗證,因此可減輕此複雜度之問題,現今 大部合成技術,並不討論電腦輔助設計,很少的電腦輔助工具具有整合分析、減少、模擬、 查詢及合成的能力,派翠圖可模擬及分析平行系統。 本人前曾發展一組合成律,可逐漸加大派翠圖,同時確保其邏輯正確無誤。 本文指出所合成的派翠圖形成一新的種類,並提出時間矩陣的概念,其可記錄程序間之關係 如平行、互斥、及序列。 基於這一觀念,吾人發展出演算法,去決定何時可用此合成法,查覺違反此合成法的情況, 及重新計算此一矩陣,此演算法之複雜度是O(K□),K是程序的總數。吾人前所發展之X 視窗工具,以將此演算法具體實踐,此工具可設計、分析,模擬測試及合成通訊協定。 |
英文摘要 | Vertification of concurrent systems faces complexity problem. Synthesis relieves this by avoiding verification. Most existing synthesis techniques do not deal with CAD tool. Few tools are able to integrate analysis, reduction, simulation, query, and synthesis in one software package as ours. Petri nets are used for modelling and analyzing concurrent systems. A set of synthesis rules were developed earlier□ for incrementally generating new processes without incurring logical incorrectness. This paper shows that the synthesized nets form a new class of nets and presents the concept of temporal matrix which records relationship (concurrent, exclusive, sequential, ...etc.) among processes. Based on this concept, we develop an algorithm to determinie the applicable rules, detect rule violations, and update the matrix. The complexity for the algorithm is O(K□) where K is the total number of processes. This algorithm has been incorporated int our X-Window based tool for the design, analysis, simulation, testing, and synthesis for communication protocols and others. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。