Dissertation > Excellent graduate degree dissertation topics show

Research on Reachability Tree for Unbounded Petri Nets

Author: LiYue
Tutor: WangShouGuang
School: Zhejiang Technology and Business University
Course: Signal and Information Processing
Keywords: unbounded Petri net reachability tree reachability problem
CLC: TP301.1
Type: Master's thesis
Year: 2014
Downloads: 1
Quote: 0
Read: Download Dissertation


As we all know, Petri nets are a powerful modeling tool in describing and analyzing the behavior of discrete event systems with graphical representation, numerous analysis methods, and a solid mathematical foundation. Although many achievements for Petri nets are presented, there exists a worldwide problem, that is, the reachability problem. Obviously, a varity of properties, such as deadlock, boundedness, liveness, conservation and coverablity, can be analyzed by reachability. As a result, reachability is the most basic property for a system.As a kind of important tool to analyze Petri nets, a reachability tree can indicate the relationship between markings and transitions. Meanwhile, it is applicable for different kinds of systems. However, there is still a problem in the area of Petri net, that is, analyzing the reachability problem of unbounded Petri nets by finite reachabitlity trees. Although some progresses are achieved by the efforts of researchers, there exist inadequacy. For example, the information of a system cannot be represented completely and accurately by the existed finite reachability trees. As a result, a research on the reachability problem is done in this paper, which is summarized as follows:1. A new finite reachability tree called coRT is proposed for a class of unbounded Petri nets, co-independent nets. The resulting ωRT consists of all reachable markings from its initial marking. Furthermore, there are not any spurious markings in an ωRT. Compared with an MRT, the number of nodes in an ωRT is much smaller than that in an MRT. Moreover, some properties are proposed and verified to solve some reachability problems, such as finiteness and deadlock.2. A new finite reachability tree called AcoRT is proposed for unbounded Petri nets. The proposed method is applicable for every Petri net. Obviously, the method has a larger application scope than all the existing methods. Moreover, a thereom is privided for deadlock detection base on the previous result.3. A modified AωRT is proposed to further simplify the structure of the finite reachability trees.Finally, conclusions and future research are provided.

Related Dissertations

  1. Research and Implementation of SIP Conformance Testing Suite Based on Petri Net,TP393.04
  2. FLS: A Labeling Scheme to Solve the Reachability Problem of Dynamic Updating Graph,TP301.6
  3. Research on Formalization of UML Based on Petri Net,TP311.52
  4. The Deadlock Analysis for Automated Manufacturing Systems Based on Petri Nets,TP399
  5. Petri net reachability tree improvement and reachability determination,TP301.6
  6. Petri Net Supervisor Synthesis on a Class of Finite Forbidden State Specifications,TM571.6
  7. Petri net - based intelligent robot system deadlock detection,TP242.6
  8. Research on Petri Net of AUV System Modeling and Capability Analyzing,TP391.9
  9. A Research on Software Testing Model and Modeling Tool Based on Petri Net,TP311.52
  10. Research on Constraint Programming Based Petri Net’s Reachability Problem,TP301.1
  11. Study of TCP Protocol Based on Petri Net,TP393.04
  12. Research on Validity of Artifact in Business Process,TP315
  13. The Modeling and Implementation of the Downhole Integrated System Based on Workflow Technology,TP311.52
  14. Research on Property Checking for Unbounded Petri Nets Based on Reachability Trees,TP301.1
  15. A Solftware Design and Implementation of Petrinet Performance Analysis,TP301.1
  16. The Research and Implementation of Protein Classification Algorithm on the Basic of String Kernel,TP301.6
  17. Research on Liquidity Requirements and Efficiency in Large-value Payment Systems,TP301.6
  18. A Hyper-heuristic Using GRASP with Path-Relinking,TP301.6
  19. Research on Methods and Application on Construction of Logistics Network with Greed Technology,TP301.6
  20. Caching Based on Actual User Behavior,TP301.6
  21. Research on Modification and Application of Particle Swarm Optimization Algorithm Based on Control Methods,TP301.6

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > General issues > Theories, methods > Automata Theory
© 2012 www.DissertationTopic.Net  Mobile