By Topic

Performance evaluation using timed coloured Petri nets

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

1 Author(s)
Zuberek, W.M. ; Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John''s, Nfld., Canada

Colored Petri nets are Petri nets in which attributes are associated with individual tokens. These attributes are called colors. The set of colors is finite. Colors can be modified during transition firings, and the same transition can perform different transformations for tokens of different colors. Colors can thus distinguish tokens, and this allows one to fold similar subnets of a net into a single subnet, reducing the model complexity. In timed colored nets. the transitions fire in real-time, i.e., there is a firing-time associated with each color and each transition of a net. A state description of timed nets is proposed which represents the behavior of a timed colored net by a probabilistic state graph. Performance analysis of timed colored nets is based on stationary probabilities of states

Published in:

Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on

Date of Conference:

12-14 Aug 1990