The mathematics of Petri nets
Reachability in cyclic extended free-choice systems
Selected papers of the 3rd workshop on Concurrency and compositionality
On Harris recurrence in continuous time
Mathematics of Operations Research
Free choice Petri nets
Probabilistic cluster unfoldings
Fundamenta Informaticae
Backward coupling in petri nets
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Backward Coupling in Bounded Free-Choice Nets Under Markovian and Non-Markovian Assumptions
Discrete Event Dynamic Systems
Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
Fundamenta Informaticae
Simplified proof of the blocking theorem for free-choice Petri nets
Journal of Computer and System Sciences
Extremal throughputs in free-choice nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Optimal stationary behavior for a class of timed continuous Petri nets
Automatica (Journal of IFAC)
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
| Hi-index | 0.00 |
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.