Design and Implementation of Automated Conformance Testing System in Petri-Net-Based Software Coding Problem
|關鍵字:||自動化製造系統;斐氏圖;規範測試;運輸模式;修正Fleury’s 演算法;Automated Manufacturing System;Petri Net;Conformance Testing;Transportation Model;Modified Fleury’s Algorithm|
For a given automated manufacturing system, the development of its control software usually involves a design phase and an implementation phase. In the design phase, the causal relation between two sequential manufacturing states can be modeled by a Petri net, and a directed network consisting of all the reachable states is named its designed reachability graph. Similarly, in the implementation phase, the corresponding Petri net is coded through a proper programming language, and its implemented reachability graph is generated naturally. Also it is necessary to test the equivalent conformance of both designed and implemented reachability graphs. In this thesis, the designed reachability graph is used to generate a testing sequence for testing the conformance of the implemented reachability graph. If the designed reachability graph is an Eulerian digraph, then its testing sequence can be directly generated by Fleury’s algorithm. If not, then a transportation model is constructed to add minimal extra edges for forming a new Eulerian digraph to which the Fleury’s algorithm can be applied. Also the cycles on the reachability graph can be detected from the diagonal elements of its powered symbol matrix. In addition, a Java-based conformance testing system has been implemented for showing the feasibility of this approach.
|Appears in Collections:||Thesis|
Files in This Item: