Extremal Throughputs in Free-Choice Nets
We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0–1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.
KeywordsFree-choice Petri nets Timed and routed nets Throughput
Unable to display preview. Download preview PDF.
- Bouillard A, Gaujal B, Mairesse J (2005). Extremal throughputs in free-choice nets. In Ciardo G Darondeau P (eds), 26th International Conference On Application and Theory of Petri Nets and Other Models of Concurrency, LNCS. Springer-Berlin Heidelberg New York.Google Scholar
- Carlier J, Chretienne P (1988). Timed Petri net schedules. In Advances in Petri Nets, number 340 in LNCS, pp. 62–84. Springer-Berlin Heidelberg New York.Google Scholar
- Chretienne P (1983). Les Réseaux de Petri Temporisés. PhD thesis, Université Paris VI, Paris.Google Scholar
- Cohen G, Gaubert S, Quadrat J (1998). Algebraic system analysis of timed Petri nets. In Gunawardena J (ed), Idempotency. Cambridge University Press.Google Scholar
- Desel J, Esparza J (1995). Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Comp. Sc. Cambridge Univ. Press.Google Scholar
- Mairesse J, Vuillon L (1998). Optimal sequences in a heap model with two pieces. Liafa research report 98/09, Université Paris 7.Google Scholar
- Recalde L, Silva M (2001). Petri net fluidification revisited: Semantics and steady state. European Journal of Automation APII-JESA 35(4):435–449.Google Scholar