Skip to Main content Skip to Navigation
Journal articles

Blocking a transition in a Free Choice net and what it tells about its throughput

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072394
Contributor : Jean Mairesse <>
Submitted on : Monday, July 30, 2007 - 12:23:22 PM
Last modification on : Friday, February 12, 2021 - 3:33:16 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 12:58:11 PM

Files

blocking-hal.pdf
Files produced by the author(s)

Identifiers

Citation

Bruno Gaujal, Stefan Haar, Jean Mairesse. Blocking a transition in a Free Choice net and what it tells about its throughput. Journal of Computer and System Sciences, Elsevier, 2003, 66 (3), pp.515-548. ⟨10.1016/S0022-0000(03)00039-4⟩. ⟨inria-00072394v2⟩

Share

Metrics

Record views

576

Files downloads

742