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

Simple item page
dc.creatorGaujal, Bruno
dc.creatorHaar, Stefan
dc.creatorMairesse, Jean
dc.date2007-07-30
dc.date.accessioned2026-07-07T08:21:02Z
dc.date.available2026-07-07T08:21:02Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0707.4372
dc.identifierhttp://arxiv.org/abs/0707.4372
dc.identifierJournal of Computer and System Sciences 66, 3 (2003) 515-548
dc.identifierdoi:10.1016/S0022-0000(03)00039-4
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135240
dc.subjectOther Computer Science
dc.titleBlocking a transition in a Free Choice net and what it tells about its throughput
dc.typetext

Files

Collections

arXiv