The stability of the deterministic Skorokhod problem is undecidable
暂无分享,去创建一个
[1] D. Gamarnik,et al. ON DECIDING STABILITY OF MULTICLASS QUEUEING NETWORKS UNDER BUFFER PRIORITY SCHEDULING POLICIES , 2007, 0708.1034.
[2] Ruth J. Williams,et al. Lyapunov Functions for Semimartingale Reflecting Brownian Motions , 1994 .
[3] D. Gamarnik,et al. Validity of heavy traffic steady-state approximations in generalized Jackson networks , 2004, math/0410066.
[4] G. Fayolle,et al. Topics in the Constructive Theory of Countable Markov Chains , 1995 .
[5] Ruth J. Williams. Semimartingale reflecting Brownian motions in the orthant , 1995 .
[6] David Gamarnik. On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks , 2007, Math. Oper. Res..
[7] Chaim Goodman-Strauss. Can ’ t Decide ? Undecide ! , 2009 .
[8] J. Dai. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .
[9] David Gamarnik. On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems , 2002, Math. Oper. Res..
[10] A. Bernard,et al. Regulations dÉterminates et stochastiques dans le premier “orthant” de RN , 1991 .
[11] A. El kharroubp,et al. Sur la récurrence positivedu mouvement brownien réflechidans l'orthant positif de , 2000 .
[12] J. Tsitsiklis,et al. The boundedness of all products of a pair of matrices is undecidable , 2000 .
[13] Ahmed El Kharroubi,et al. On the stability of the linear Skorohod problem in an orthant , 2002, Math. Methods Oper. Res..
[14] Ann Appl,et al. On the Positive Harris Recurrence for Multiclass Queueing Networks: a Uniied Approach via Uid Limit Models , 1999 .
[15] G. Fayolle,et al. Topics in the Constructive Theory of Countable Markov Chains: Ideology of induced chains , 1995 .
[16] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .
[17] David Gamarnik,et al. Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results. , 2002, PERV.
[18] Yurii Rogozhin,et al. Small Universal Turing Machines , 1996, Theor. Comput. Sci..
[19] Philip K. Hooper. The undecidability of the Turing machine immortality problem , 1966, Journal of Symbolic Logic.
[20] Amarjit Budhiraja,et al. Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic , 2009, Math. Oper. Res..
[21] John N. Tsitsiklis,et al. Deciding stability and mortality of piecewise affine dynamical systems , 2001, Theor. Comput. Sci..
[22] D. Yao,et al. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.
[23] David Gamarnik,et al. Validity of Heavy Traffic Steady-State Approximations in Open Queueing Networks , 2004 .
[24] V. Malyshev. NETWORKS AND DYNAMICAL SYSTEMS , 1993 .
[25] Alain Bernard,et al. Réflexions (ou régulations) de processus dans le premier «orthant» de Rn , 1989 .
[26] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[27] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[28] Maury Bramson,et al. A positive recurrent reflecting brownian motion with divergent fluid path , 2010 .
[29] R. J. Williams,et al. Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant , 1993 .
[30] J. Harrison,et al. Brownian motion and stochastic flow systems , 1986 .
[31] John N. Tsitsiklis,et al. A survey of computational complexity results in systems and control , 2000, Autom..
[32] David D. Yao,et al. Fundamentals of Queueing Networks , 2001 .
[33] G. Fayolle,et al. Random Walks in the Quarter-Plane: Algebraic Methods, Boundary Value Problems and Applications , 1999 .
[34] J. Harrison,et al. Positive recurrence of reflecting Brownian motion in three dimensions , 2010, 1009.5746.