An algorithm for the optimization of nonbifurcated flows in computer communication networks. - Pierre-Jacques Courtois; Pierre Semal (Perform. Evaluation, 1981)

Error Bounds for the Analysis by Decomposition of Non-Negative Matrices. - Pierre-Jacques Courtois; Pierre Semal (Computer Performance and Reliability, 1983)

Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition. - Pierre-Jacques Courtois; Pierre Semal (J. ACM, 1984)

Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models. - Pierre-Jacques Courtois; Pierre Semal (IEEE J. Sel. Areas Commun., 1986)

Stability Analysis of Large Markov Chains. - Pierre Semal; Pierre-Jacques Courtois (Performance, 1987)

A fast restoration system for ATM-ring-based LANs. - Klaus Peter May; Pierre Semal; Yonggang Du; Christoph Herrmann (IEEE Commun. Mag., 1995)

Refinable Bounds for Large Markov Chains. - Pierre Semal (IEEE Trans. Computers, 1995)

Measuring the Survivability of a Network: Connectivity and Rest-Connectivity. - Manuel Duque-Antón; Frederic Bruyaux; Pierre Semal (Eur. Trans. Telecommun., 2000)

Histogram based bounds and approximations for production lines. - Jean-Sébastien Tancrez; Pierre Semal; Philippe Chevalier (Eur. J. Oper. Res., 2009)

Probability masses fitting in the analysis of manufacturing flow lines. - Jean-Sébastien Tancrez; Philippe Chevalier; Pierre Semal (Ann. Oper. Res., 2011)

A Tight Bound on the Throughput of Queueing Networks with Blocking. - Jean-Sébastien Tancrez; Philippe Chevalier; Pierre Semal (ASMTA, 2013)