Submissions

• A. Busic, N. Fates, J. Mairesse, I. Marcovici. Density classification on infinite lattices and trees. Preprint arXiv:1111.4582. 2011.
  Short version accepted at LATIN 2012.
• A. Busic, J. Mairesse, I. Marcovici. Probabilistic cellular automata, invariant measures, and perfect sampling. Preprint arXiv:1010.3133. 2010.
  Poster presented at Simulation of Networks Workshop, June 2010 Isaac Newton Institute for Mathematical Sciences, Cambridge, UK. [poster]
  Short version appeared at STACS 2011. [short]
• A. Busic, V. Gupta, J. Mairesse. Stability of the bipartite matching model. Preprint arXiv:1003.3477v1. 2010.
  Poster presented at Stochastic Networks, March 2010 Isaac Newton Institute for Mathematical Sciences, Cambridge, UK. [poster]
  Short version appeared at MAMA workshop 2010. ACM SIGMETRICS Perform. Eval. Rev. 38:2, pp. 6-8. 2010. [short]

Journals

• A. Busic, B. Gaujal, F. Pin. Perfect Sampling of Markov Chains with Piecewise Homogeneous Events. Accepted for publication in Performance Evaluation.
  Preprint arXiv:1012.2910. 2010.
• A. Busic, I. Vliegen, A. Scheller-Wolf. Comparing Markov chains: Aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems. Accepted for publication in Mathematics of Operations Research.
  Preprint HAL : hal-00361430. 2009.
• A. Busic, J.-M. Fourneau. Iterative component-wise bounds for the steady-state distribution of a Markov chain. Numerical Linear Algebra with Applications. John Wiley & Sons, Ltd. Available online: October 2011. (Special Issue Paper.)
• A. Busic, J.-M. Fourneau. Monotonicity and performance evaluation: applications to high speed and mobile networks. Cluster Computing. Springer Netherlands. Available online: April 2011. (Special Issue Paper.)
• M. Ben Mamoun, A. Busic, N. Pekergin. Generalized class C Markov chains and computation of closed-form bounding distributions. Probability in the Engineering and Informational Sciences. Cambridge University Press, 21(2):235-260, 2007.

Conferences

• A. Wieczorek, A. Busic, E. Hyon. Critical Level Policies in Lost Sales Inventory Systems with Different Demand Classes. EPEW 2011, Borrowdale, The English Lake District, UK. October 2011. LNCS 6977, Springer-Verlag, pp. 204-218.
• A. Busic, E. Coupechoux. Perfect Sampling with Aggregated Envelopes. Allerton 2011.
• F. Pin, A. Busic, B. Gaujal. Acceleration of Perfect Sampling by Skipping Events. Valuetools 2011, Paris, France.
• A. Busic, J. Mairesse, I. Marcovici. Probabilistic cellular automata, invariant measures, and perfect sampling. STACS 2011.
  Poster presented at Simulation of Networks Workshop, June 2010 Isaac Newton Institute for Mathematical Sciences, Cambridge, UK. [poster]
• A. Busic, B. Gaujal, G. Gorgo, J.-M. Vincent. PSI2 : Envelope Perfect Sampling of Non Monotone Systems. International Conference on Quantitative Evaluation of Systems (QEST), Williamsburg, USA, 2010.
  Tool paper. [pdf]
• A. Busic, J.-M. Fourneau. A toolbox for component-wise bounds of the steady-state distribution of a DTMC. International Conference on Quantitative Evaluation of Systems (QEST), Williamsburg, USA, 2010.
  Tool paper.
• A. Busic, H. Djafri, J.-M. Fourneau. Stochastic bounds for censored Markov chains. 6th International Workshop on the Numerical Solution of Markov Chains (NSMC), Williamsburg, USA, 2010.
• A. Busic, J.-M. Fourneau. Iterative component-wise bounds for the steady-state distribution of a Markov chain. 6th International Workshop on the Numerical Solution of Markov Chains (NSMC), Williamsburg, USA, 2010.
• A. Busic, B. Gaujal, J.-M. Vincent. Perfect Simulation and Non-monotone Markovian Systems. Valuetools'08, October 2008, Athens, Greece. [.pdf]
• A. Busic, J.-M. Fourneau. Stochastic Complement and Strong Stochastic Bounds Based on Algebraic Properties. 5th European Performance Engineering Workshop (EPEW 2008), September 2008, Palma de Mallorca, Spain. LNCS 5261, Springer-Verlag, pp. 227-241. [.pdf]
• V. Berten, A. Busic, B. Gaujal, J.-M. Vincent. Can we use perfect simulation for non-monotonic Markovian systems? Extended abstract. ROADEF 2008, Clermont- Ferrand, France, 25-27 February 2008.
• A. Busic, T. Czachorski, J.-M. Fourneau, K. Grochla. Level Crossing Ordering of Markov Chains: Computing End to End Delays in an All Optical Network. Valuetools'07, October 2007, Nantes, France. [.pdf]
• A. Busic, N. Pekergin. Closed Form Absorption Time Bounds. 4th European Performance Engineering Workshop (EPEW 2007), September 2007, Berlin, Germany. LNCS 4748, Springer-Verlag, pp. 33-47.
• D. Barth, A. Busic, J.-M. Fourneau, D. Nott, F. Quessette, S. Rousseau. Guaranteeing burst routing in the ROMEO optical network. In Proceedings of Asia-Pacific Optical Communica-tions 2007 (APOC'07), Wuhan, China. SPIE. (Invited.)
• M. Ben Mamoun, A. Busic, J.-M. Fourneau, N. Pekergin. Increasing convex monotone Markov chains: Theory, algorithm and applications. MAM 2006: Markov Anniversary Meeting, Eds. A. N. Langville, W. J. Stewart, Boson Books, Raleigh, North Carolina, USA, 2006, pp. 189-210. [.ps] [.pdf]
• A. Busic, J.-M. Fourneau. Bounds based on lumpable matrices for partially ordered state space. In Proceeding From the 2006 Workshop on Tools For Solving Structured Markov Chains (Pisa, Italy, October 10 - 10, 2006). SMCtools '06, vol. 201. ACM Press. [.ps] [.pdf]
• A. Busic, M. Ben Mamoun, J.-M. Fourneau. Modeling Fiber Delay Loops in an All Optical Switch. In Proceedings of the Third international Conference on the Quantitative Evaluation of Systems - (Qest'06) - (September 11 - 14, 2006). IEEE Computer Society. [.ps] [.pdf]
• A. Busic, J.-M. Fourneau, D. Nott. Deflection Routing on a Torus is Monotone. Positive Systems. Proceedings of the second Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 06), Grenoble, France, Aug. 30-31, Sept. 1, 2006. LNCIS 341, Springer. pp. 161-168. [.ps] [.pdf]
• A. Busic, J.-M. Fourneau, N. Pekergin. Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering. 3rd European Performance Engineering Workshop (EPEW 2006), June 2006, Budapest, Hungary. In : A. Horvath and M. Telek (Eds.): EPEW 2006, LNCS 4054, Springer-Verlag, pp. 196-210. [.ps] [.pdf]
• A. Busic, J.-M. Fourneau. Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering. 2rd European Performance Engineering Workshop (EPEW 2005), Semptember 2005, Versailles, France. In: M. Bravetti et al. (Eds.): EPEW 2005 and WS-FM 2005, LNCS 3670, Springer-Verlag, pp. 94-108. [.ps] [.pdf]
• A. Busic, J-M. Fourneau. Bounding transient and steady-state dependability measures through algorithmic stochastic comparison. SIGMETRICS Perform. Eval. Rev. 34, 2 (Sep. 2006), 11-12. [.ps] [.pdf]
  (Extended abstract of a poster presented at Performance 2005, Juan-les-Pins, October 2005)
• A. Busic, J.-M. Fourneau. A Matrix Pattern Compliant Strong Stochastic Bound. Modelling and Performance Evaluation for Quality of Service in Next Generation Internet, January 2005, Trento, Italy. In: M. Papazoglu and K. Yamazaki (eds.), Applications and the Internet SAINT 2005 Workshops. IEEE Computer Society, pp. 256-259. [.ps] [.pdf]