@article{(Open Science Index):https://publications.waset.org/pdf/14513,
	  title     = {A Technique for Reachability Graph Generation for the Petri Net Models of Parallel Processes},
	  author    = {Farooq Ahmad and  Hejiao Huang and  Xiaolong Wang},
	  country	= {},
	  institution	= {},
	  abstract     = {Reachability graph (RG) generation suffers from the
problem of exponential space and time complexity. To alleviate the
more critical problem of time complexity, this paper presents the new
approach for RG generation for the Petri net (PN) models of parallel
processes. Independent RGs for each parallel process in the PN
structure are generated in parallel and cross-product of these RGs
turns into the exhaustive state space from which the RG of given
parallel system is determined. The complexity analysis of the
presented algorithm illuminates significant decrease in the time
complexity cost of RG generation. The proposed technique is
applicable to parallel programs having multiple threads with the
synchronization problem.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {3},
	  number    = {3},
	  year      = {2009},
	  pages     = {811 - 815},
	  ee        = {https://publications.waset.org/pdf/14513},
	  url   	= {https://publications.waset.org/vol/27},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 27, 2009},