东华大学学报（英文版）2004，Vol.21Issue(3)：180-184,5.
An Algorithm to Construct Concurrent Reachability Graph of Petri Nets
An Algorithm to Construct Concurrent Reachability Graph of Petri Nets
摘要
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.关键词
Petri nets/concurrent system/Concurrent Reachable Marking/concurrent reachable marking set/Concurrent Reachability GraphKey words
Petri nets/concurrent system/Concurrent Reachable Marking/concurrent reachable marking set/Concurrent Reachability Graph分类
信息技术与安全科学引用本文复制引用
张金泉,倪丽娜,蒋昌俊..An Algorithm to Construct Concurrent Reachability Graph of Petri Nets[J].东华大学学报（英文版）,2004,21(3):180-184,5.基金项目
This work is support partially by projects of National Preeminent Youth Science Foundation (No. 60125205)、National 863 Plan(2002AA4Z3430, 2002AA1Z2102A)、Excellent Ph.D Paper Author Foundation of China (199934)、Foundation for University Key Teacher by the （No. 60125205）
