Performance evaluation using timed coloured Petri nets

Abstract

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