Computer Science – Other Computer Science
Scientific paper
2007-07-30
Journal of Computer and System Sciences 66, 3 (2003) 515-548
Computer Science
Other Computer Science
Scientific paper
10.1016/S0022-0000(03)00039-4
In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded Free Choice net, this property is true for any transition of the net. Consider now a live and bounded stochastic routed Free Choice net, and assume that the routings and the firing times are independent and identically distributed. Using the above results, we prove the existence of asymptotic firing throughputs for all transitions in the net. Furthermore the vector of the throughputs at the different transitions is explicitly computable up to a multiplicative constant.
Gaujal Bruno
Haar Stefan
Mairesse Jean
No associations
LandOfFree
Blocking a transition in a Free Choice net and what it tells about its throughput does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Blocking a transition in a Free Choice net and what it tells about its throughput, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blocking a transition in a Free Choice net and what it tells about its throughput will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-359324