|
|||||
|
|
| An Algorithm to Construct Concurrent Reachability Graph of Petri Nets | |
| 作者姓名： | 张金泉 倪丽娜 蒋昌俊 |
| 作者单位： | Department of Computer Science，Tongji University，200092，Shanghai College of Information Science & Engineering，Shan Dong University of Science & Tech，271019，Shan Dong，Taian，College of Information Science & Engineering，Shan Dong University of Science & Tech，271019，Shan Dong，Taian，Department of Computer Science，Tongji University，200092，Shanghai |
| 基金项目： | projectsofNationalPreeminentYouthScienceFoundation(No.60125205)、National863Plan(2002AA4Z3430,2002AA1Z2102A)、ExcellentPh.DPaperAuthorFoundationofChina(199934)、FoundationforUniversityKeyTeacherbytheMinstryofEducation,Shanghai |
| 摘 要： | IntroductionPetrinetisausefultooltomodelaconcurrentsystemandanalyzeitsproperties.1]ThetheoryofPetrinetshasdevelopedsoundlysinceitwasputforwardin1962andwaswidelyappliedtomanyfieldssuchasflexiblemanufacturingsystem,workflow,webservice,etc.234]ReachabilitygraphisapowerfultooltoanalyzethedynamicpropertiesofPetrinets,bywhichthefiringofconcurrenttransitionsinPetrinetsisrepresentedinaserialmanner.Thatis,Petrinetitselfisaconcurrentmodel,whileitsreachabilitygraphisserial.Infact,concurrencyrelations… |
An Algorithm to Construct Concurrent Reachability Graph of Petri Nets |
|
| ZHANG Jin-quan.An Algorithm to Construct Concurrent Reachability Graph of Petri Nets[J].Journal of Donghua University,2004,21(3). | |
| Authors: | ZHANG Jin-quan |
| Institution: | 1. Department of Computer Science, Tongji University, 200092,Shanghai;College of Information Science & Engineering, Shan Dong University of Science & Tech,271019,Shan Dong, Taian 2. College of Information Science & Engineering, Shan Dong University of Science & Tech, 271019, Shan Dong, Taian 3. Department of Computer Science,Tongji University,200092,Shanghai |
| Abstract: | Reachability graph is a very important tool to analyze the dynamic properties of Petri nets, but the concurrent relation of transitions in Petri nets cannot be represented by reachability graph. Petri net is a concurrent system, while reachability graph is a serial one. However, concurrency is a kind of property which is not only very significant but also difficult to be analyzed and controlled. This paper presents the concepts of concurrent reachable marking and concurrent reachable graph in order to represent and analyze the concurrent system. The algorithm constructing concurrent reachable marking set and concurrent reachability graph is also shown so that we can study the response problems among services in a network computing environment and analyze the throughput of the system. The Dining Philosophers Problem, which is a classic problem of describing the management of concurrent resources, is given as an example to illustrate the significance of concurrent reachability graph. |
| Keywords: | Petri nets concurrent system Concurrent Reachable Marking concurrent reachable marking set Concurrent Reachability Graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |