David Auger and Olivier Teytaud. The Frontier of Decidability in Partially Observable Recursive Games. International Journal on Foundations of Computer Science (IJFCS), special issue on the frontier between decidability and undecidability and related problems, 2012. BibTeX

@article{AuTe12,
author = "Auger, David and Teytaud, Olivier",
title = "The Frontier of Decidability in Partially Observable Recursive Games",
journal = "International Journal on Foundations of Computer Science (IJFCS), special issue on the frontier between decidability and undecidability and related problems",
year = 2012,
annote = "revint"
}

Farah Ait Salaht, Jean-Michel Fourneau and Nihal Pekergin. Computing bounds of the MTTF for a set of Markov Chains. In 28th International Symposium on Computer and Information Sciences, Paris, France. 2013. BibTeX

David Poulain, Joanna Tomasik, Marc-Antoine Weisser and Dominique Barth. Minimization of the receiver cost in an all-optical ring with a limited number of wavelengths. In 27th International Symposium on Computer and Information Sciences (ISCIS). 2012. URLBibTeX

Jean-Michel Fourneau, Farah Ait Salaht and Nihal Pekergin. Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains. In 27th International Symposium on Computer and information Sciences (ISCIS). 2012, 115-122. BibTeX

Jean-Michel Fourneau. Product Form Solution for a Simple Control of the Power Consumption in a Service Center. In 27th International Symposium on Computer and information Sciences (ISCIS). 2012, 143-150. BibTeX

Dominique Barth, Boubkeur Boudaoud and Thierry Mautor. Game Theory for Contracts Establishment with Guaranteed QoS in the Inter-Domain Network. In International Conference on Communications and Information Technology (ICCIT). 2012, 282-286. BibTeX

Jean-Michel Fourneau and Franck Quessette. Monotone Queuing Networks and Time Parallel Simulation. In 18th International Conference on Analytical and Stochastic Modeling Techniques and Aplications (ASMTA). 2011, 204-218.AbstractWe show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.BibTeX

@inproceedings{FoQu11b,
author = "Fourneau, Jean-Michel and Quessette, Franck",
title = "Monotone Queuing Networks and Time Parallel Simulation",
booktitle = "18th International Conference on Analytical and Stochastic Modeling Techniques and Aplications (ASMTA)",
year = 2011,
series = "Lecture Notes in Computer Science (LNCS)",
pages = "204-218",
publisher = "Springer",
abstract = "We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.",
annote = "confint",
owner = "MOIS",
timestamp = "2011.07.28"
}

Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. Stochastic Comparisons Applied to G-Networks with Catastrophes. In Springer (ed.). 25th International Symposium on Computer and Information Sciences (ISCIS) 62. 2010, 57-60.AbstractWe study the transient distribution of some G-networks of queues with customers and signals. After its service completion a customer moves to another queue and may become a signal. We consider catastrophes where the signal deletes all customers in a queue. Both networks with negative customers and with catastrophes belong to well known of Gelenbe's networks with product form steady-state distribution. As the transient distribution is impossible to obtain, we derive stochastic upper and lower bounds on the marginal distribution for each queue following Massey's approach.URLBibTeX

Anna Busic and Jean-Michel Fourneau. Iterative component-wise bounds for the steady-state distribution of a Markov chain. In 6th International Workshop on the Numerical Solution of Markov Chain. 2010. BibTeX

Ana Busic and Jean-Michel Fourneau. A Toolbox for Component-Wise Bounds for Steady-State Distribution of a DTMC. In Seventh International Conference on the Quantitative Evaluation of Systems (QEST). 2010, 81-82. BibTeX

A Genitrini, J Kozik and G Matecki. On the density and the structure of the Pierce-like formulae. In Fifth Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities. septembre 2008. BibTeX

Yacine Benallouche and Dominique Barth. Optimized multicast tree for handover in a two-nodes mobile network architecture based on a all-IP infrastructure. In The Fourth International Conference on Wireless and Mobile Communications (ICWMC). 2008. BibTeX