Font Size: a A A

Study Of Network Route And Capacity On Petri Net

Posted on:2010-04-30Degree:MasterType:Thesis
Country:ChinaCandidate:Y Z GongFull Text:PDF
GTID:2178360275467804Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
With complexity of the system increased,the Petri Net model is larger then befor, there has been difficult to determine and analyze the network path,however,the rapid solution of the large system capacity can not be avoided.Most of the analysis methods of Petri Nets are based on its state space and Markov chain(MC) with same structure, and its state-space increases exponentially as the system growing,which makes this promble difficult to solve.This article has just begun to consider a simple the network route definition and find problem in Timed Petri Nets,the ant colony algorithm for timed Petri Nets to solve the path of looking for problems Petri_ACO_Route algorithm.To get good effect of the algorithm,keep ant colony algorithm the unique optimal mechanism,and reasonable deal with the special structure of petri Nets are key to the problem.In addition,this paper gives the wide path and part path concept,and gives a design example to show the complexity of the algorithm at the Petri Nets in problem-solving abilities.Then,we have studied network path search method for solving the application performance in SPN.SPN performance method include:solution of equations to solve the model performance indicators,and the use of simulation techniques to analyze the SPN model.Simulation method avoid state space explosion problem,suitable for solving large-scale system performance indicators.We use the heuristic algorithm to search path in the complex SPN search path environment,combined with theoretical calculations of probability theory related system performance,to solve a large-scale redundancy analysis of the performance of the system problem.Finally focus on the path to look for ways to mesh at CSPN solving application performance,and performance of this path analysis methods used to address the use of control model (Usage Control,UCON) the reliability of the analysis.This article focuses on the path search problem in Timed Petri Nets,SPN,CSPN. In the path search,the different sections of this paper to consider the impact of different factors,and in order to give the path of the search methods and performance analysis methods,each chapter of this article improve the Petri Net modeling method and ant colony algorithm.And this theory is applied to the UCON analysis.
Keywords/Search Tags:CSPN, UCON, reliability, timed Petri net, network route
PDF Full Text Request
Related items