International audienceWe consider Stochastic Automata Networks (SAN) in continuous time and we prove a sufficient condition for the steady-state distribution to have product form. We consider SAN without synchronizations where the transitions of one automaton may depend of the states of the other automata. Even with this restriction, this sufficient condition is quite simple and this theorem generalizes former results on SAN but also on modulated Markovian queues, such as the Boucherie's theory on competing Markov chain, or on reversible queues considered by Kelly. The sufficient condition and the proof are purely algebraic
In this paper we provide a general method to derive product-form solutions for stochastic models. We...
Abstract. The analysis of models specified with formalisms like Marko-vian process algebras or stoch...
International audienceWe consider discrete time Markov chains in competition over a set of resources...
International audienceWe consider Stochastic Automata Networks (SAN) in continuous time and we prove...
We consider Stochastic Automata Networks (SAN) in con-tinuous time and we prove a sufficient conditi...
International audienceWe consider Stochastic Automata Networks (SANs) in continuous time and we prov...
International audienceWe present a new kind of synchronization which allows Continuous Time Stochast...
We present a class of Stochastic Automata Networks (SAN) which exhibit a product form solution if so...
Abstract: We consider continuous-time Markov chains representing queueing systems in random environm...
A resurgence in product-forms Interest in the stochastic behaviour of queueing networks began in the...
In the last few years some novel approaches have been developed to analyse Markovian stochastic mode...
This article presents a global overview of recent results concerning stochastic automata networks. A...
The analysis of models specified with formalisms like Markovian process algebras or stochastic autom...
Product-form models are a class of Markovian models whose steady-state solution can be computed effi...
In this paper we provide a general method to derive product-form solutions for stochastic models. We...
Abstract. The analysis of models specified with formalisms like Marko-vian process algebras or stoch...
International audienceWe consider discrete time Markov chains in competition over a set of resources...
International audienceWe consider Stochastic Automata Networks (SAN) in continuous time and we prove...
We consider Stochastic Automata Networks (SAN) in con-tinuous time and we prove a sufficient conditi...
International audienceWe consider Stochastic Automata Networks (SANs) in continuous time and we prov...
International audienceWe present a new kind of synchronization which allows Continuous Time Stochast...
We present a class of Stochastic Automata Networks (SAN) which exhibit a product form solution if so...
Abstract: We consider continuous-time Markov chains representing queueing systems in random environm...
A resurgence in product-forms Interest in the stochastic behaviour of queueing networks began in the...
In the last few years some novel approaches have been developed to analyse Markovian stochastic mode...
This article presents a global overview of recent results concerning stochastic automata networks. A...
The analysis of models specified with formalisms like Markovian process algebras or stochastic autom...
Product-form models are a class of Markovian models whose steady-state solution can be computed effi...
In this paper we provide a general method to derive product-form solutions for stochastic models. We...
Abstract. The analysis of models specified with formalisms like Marko-vian process algebras or stoch...
International audienceWe consider discrete time Markov chains in competition over a set of resources...