کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
463414 697035 2008 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An algebraic condition for product form in stochastic automata networks without synchronizations
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
An algebraic condition for product form in stochastic automata networks without synchronizations
چکیده انگلیسی

We consider Stochastic Automata Networks (SANs) in continuous time and we prove a sufficient condition for the steady-state distribution to have product form. We consider synchronization-free SANs in which the transitions of one automaton may depend upon the states of the other automata. This model can represent efficiently multidimensional Markov chains whose transitions are limited to one component but whose rates may depend on the state of the chain.The sufficient condition we obtain is quite simple and our theorem generalizes former results on SANs as well as results on modulated Markovian queues, such as Boucherie’s theory on competing Markov chain, on reversible queues considered by Kelly and on modulated Jackson queueing networks studied by Zhu. The sufficient condition and the proof are purely algebraic and are based on the intersection of kernels for a certain set of matrices.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Performance Evaluation - Volume 65, Issues 11–12, November 2008, Pages 854–868
نویسندگان
, , ,