O. Abu-amsha and J. Vincent, An algorithm to bound functionals of Markov chains with large state space, 4th INFORMS Conference on Telecommunications, number 3.2, pp.3-5, 1998.

P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin, COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic, 2011 Eighth International Conference on Quantitative Evaluation of SysTems, pp.143-144, 2011.
DOI : 10.1109/QEST.2011.24

B. Barbot, S. Haddad, and C. Picaronny, Coupling and Importance Sampling for Statistical Model Checking, Lecture Notes in Computer Science, vol.7214, pp.331-346, 2012.
DOI : 10.1007/978-3-642-28756-5_23
URL : https://hal.archives-ouvertes.fr/hal-00776795

H. Castel, L. Mokdad, and N. Pekergin, Stochastic Bounds Applied to the End to End QoS in Communication Systems, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp.374-380, 2007.
DOI : 10.1109/MASCOTS.2007.62

G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, Stochastic well-formed colored nets and symmetric modeling applications, IEEE Transactions on Computers, vol.42, issue.11, pp.1343-1360, 1993.
DOI : 10.1109/12.247838

G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, A symbolic reachability graph for coloured petri nets, Theoretical Computer Science, vol.176, issue.1-2, pp.39-65, 1997.
DOI : 10.1016/S0304-3975(96)00010-2
URL : https://doi.org/10.1016/s0304-3975(96)00010-2

G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo, GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets, Performance Evaluation, vol.24, issue.1-2, pp.47-68, 1995.
DOI : 10.1016/0166-5316(95)00008-L

J. Fourneau, M. Lecoz, and F. Quessette, Algorithms for an irreducible and lumpable strong stochastic bound, Linear Algebra and its Applications, vol.386, pp.167-185, 2004.
DOI : 10.1016/j.laa.2004.02.005
URL : https://hal.archives-ouvertes.fr/hal-01309511

J. Fourneau, L. Mokdad, and N. Pekergin, Stochastic bounds for performance evaluation of web services. Concurrency and Computation: Practice and Experience, pp.1286-1307, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01309351

J. Fourneau, L. Mokdad, N. Pekergin, and S. Youcef, Stochastic Bounds for Loss Rates, The Third Advanced International Conference on Telecommunications (AICT'07), p.9, 2007.
DOI : 10.1109/AICT.2007.40

J. Fourneau and N. Pekergin, An Algorithmic Approach to Stochastic Bounds, Performance Evaluation of Complex Systems: Techniques and Tools, pp.64-88, 2002.
DOI : 10.1007/3-540-45798-4_4
URL : https://hal.archives-ouvertes.fr/hal-00155127

S. Haddad, L. Mokdad, and S. Youcef, Bounding models families for performance evaluation in composite Web services, Journal of Computational Science, vol.4, issue.4, pp.232-241, 2013.
DOI : 10.1016/j.jocs.2011.11.003
URL : https://hal.archives-ouvertes.fr/hal-00920332

S. Haddad and P. Moreaux, Sub-stochastic matrix analysis for bounds computation???Theoretical results, European Journal of Operational Research, vol.176, issue.2, pp.999-1015, 2007.
DOI : 10.1016/j.ejor.2005.08.016
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HM-ejor07.pdf

L. Mokdad and H. Castel-taleb, Stochastic comparisons: A methodology for the performance evaluation of fixed and mobile networks, Computer Communications, vol.31, issue.17, pp.313894-3904, 2008.
DOI : 10.1016/j.comcom.2008.06.025
URL : https://hal.archives-ouvertes.fr/hal-00545687

B. Plateau, On the stochastic structure of parallelism and synchronization models for distributed algorithms, Proceedings of the 1985 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '85, pp.147-154, 1985.