By Topic

A technique for generating the reduced reachability graph of petri net models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ahmad, F. ; Shenzhen Grad. Sch., Dept. of Comput. Sci. & Technol., Harbin Inst. of Technol., Shenzhen ; Hejiao Huang ; Xiao-Long Wang ; Anwer, W.

The reachability graph technology is the basic and important method of analysis and verification of a system but it suffers from state explosion problem. To cope with this problem, this paper introduces transition vectors which can detect all the enabled transitions at given state of system and identify them as dependent or independent. Transition vectors have been found useful and functional for simultaneous execution of concurrently enabled transitions. An efficient algorithm based on transition vectors has been presented to generate the reduced reachability graph and compared with the reduced reachability graph constructed by stubborn set method.

Published in:

Systems, Man and Cybernetics, 2008. SMC 2008. IEEE International Conference on

Date of Conference:

12-15 Oct. 2008