政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/102738
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113648/144635 (79%)
Visitors : 51579001      Online Users : 596
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    政大典藏 > Journal of NCCU > Issue 73 > Journal Articles >  Item 140.119/102738


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/102738


    Title: X Window Implementation of an Algorithm to Synthesize Ordinary Petri Nets
    Authors: 趙玉
    Chao, D. Y.
    Contributors: 資管系
    Date: 1996-10
    Issue Date: 2016-10-12 15:48:23 (UTC+8)
    Abstract: 平行系統之證明極為複雜，合成法用不著驗證，因此可減輕此複雜度之問題，現今大部分合成技術，並不討論電腦輔助設計，很少的電腦輔助工具具有整合分析、減少、模擬、查詢及合成的能力，派翠圖可模擬及分析平行系統。本人前曾發展－組合成律，可逐漸加大派翠圖，同時確保其邏輯正確無誤。本文指出所合成的派翠圖形成一新的種類，並提出時間矩陣的概念，其可記錄程序間之關係如平行、互斥、及序列。基於這一觀念，吾人發展出演算法，去決定何時可用此合成法，查覺違反此合成法的情況，及重新計算此一矩陣，此演算法之複雜度是Ｏ(Ｋ3)，Ｋ是程序的總數。吾人前所發展之Ｘ視窗工具，以將此演算法具體實踐，此工具可設計、分析，模擬測試及合成通訊協定。
    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 earlier1-3 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(K3) 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.
    Relation: 國立政治大學學報,73 part2,451-496
    Data Type: article
    Appears in Collections:[Issue 73] Journal Articles

    Files in This Item:

    File Description SizeFormat
    73-2-451.pdf2961KbAdobe PDF2654View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback