By Topic

On some analysis properties of colored Petri net using underlying net

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
$33 $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

2 Author(s)
A. Ohta ; Fac. of Inf. Sci. & Technol., Aichi Prefectural Univ., Japan ; K. Tsuji

Petri net is an effective tool to model and evaluate concurrent systems. Colored Petri net has been proposed to model large scale systems more effectively. Among analysis tools for colored Petri nets, such as reachability tree, to net invariants, to unfolded equivalent noncolored net, we use underlying noncolored Petri net. This method requires restriction on binding of the arc expression. In this report, some analysis properties of colored Petri net are studied using its underlying noncolored net. Sufficient conditions for boundedness and persistency are derived. Some restrictions on structure and binding are used to obtain a necessary condition for liveness.

Published in:

Circuits and Systems, 2004. MWSCAS '04. The 2004 47th Midwest Symposium on  (Volume:3 )

Date of Conference:

25-28 July 2004