Skip to main content
SpringerLink
Log in

Extremal Throughputs in Free-Choice Nets

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baccelli F, Cohen G, Olsder G, Quadrat J (1992). Synchronization and Linearity. Wiley, New York.

    MATH  Google Scholar 

  • 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.

  • 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.

  • Chretienne P (1983). Les Réseaux de Petri Temporisés. PhD thesis, Université Paris VI, Paris.

  • Cohen G, Dubois D, Quadrat J, Viot M (1985). A linear system–theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. IEEE Trans Automat Contr 30:210–220.

    Article  MATH  MathSciNet  Google Scholar 

  • Cohen G, Gaubert S, Quadrat J (1998). Algebraic system analysis of timed Petri nets. In Gunawardena J (ed), Idempotency. Cambridge University Press.

  • Desel J, Esparza J (1995). Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Comp. Sc. Cambridge Univ. Press.

  • Gaubert S, Mairesse J (1999). Modeling and analysis of timed Petri nets using heaps of pieces. IEEE Trans Automat Contr 44(4):683–698.

    Article  MATH  MathSciNet  Google Scholar 

  • Gaujal B, Giua A (2004). Optimal stationary behavior for a class of timed continuous Petri nets. Automatica 40(9):1505–1516.

    Article  MATH  MathSciNet  Google Scholar 

  • Gaujal B, Haar S, Mairesse J (2003). Blocking a transition in a free choice net and what it tells about its throughput. J Comput Syst Sci 66(3):515–548.

    Article  MATH  MathSciNet  Google Scholar 

  • Mairesse J, Vuillon L (1998). Optimal sequences in a heap model with two pieces. Liafa research report 98/09, Université Paris 7.

  • 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 

Download references

Author information

Authors and Affiliations

  1. LIP UMR CNRS, ENS Lyon, INRIA, Université Claude Bernard Lyon 1, École Normale Supérieure de Lyon, 46, allée d'Italie, F-69364, Lyon, Cedex 07, France

    Anne Bouillard

  2. Lab. ID-MAG, INRIA-CNRS-UJF-INPG 51, av. J. Kuntzman, F-38330, Montbonnot, France

    Bruno Gaujal

  3. CNRS-Université Paris 7, LIAFA, Case 7014, 2 place Jussieu, F-75251, Paris, cedex 05, France

    Jean Mairesse

Authors
  1. Anne Bouillard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Gaujal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean Mairesse
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anne Bouillard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouillard, A., Gaujal, B. & Mairesse, J. Extremal Throughputs in Free-Choice Nets. Discrete Event Dyn Syst 16, 327–352 (2006). https://doi.org/10.1007/s10626-006-9326-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-006-9326-y

Keywords

Search

Navigation