The Stability of Saturated Linear Dynamical Systems is Undecidable

The Stability of Saturated Linear Dynamical Systems is Undecidable (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Vincent Blondel , Olivier Bournez , Pascal Koiran , John N. Tsitsiklis

Citations:

15 - 6 self

BibTeX

@MISC{Blondel99thestability,
    author = {Vincent Blondel and Olivier Bournez and Pascal Koiran and John N. Tsitsiklis},
    title = {The Stability of Saturated Linear Dynamical Systems is Undecidable },
    year = {1999}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

3376	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
514	The algorithmic analysis of hybrid systems - Alur, Courcoubetis, et al. - 1995
325	On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines - Blum, Shub, et al. - 1989
286	Mathematical Control Theory: Deterministic Finite Dimensional Systems. Second Edition - Sontag - 1998
263	Complexity and Real Computation - Blum, Cucker, et al. - 1998
234	What’s decidable about hybrid automata - Henzinger, Kopke, et al. - 1995
139	On the computational power of neural nets - Siegelmann, ED - 1995
138	algebraic geometry - Bochnak, Coste, et al. - 1998
94	Reachability analysis of dynamical systems having piecewiseconstant derivaties - Asarin, Maler, et al. - 1995
82	A survey of computational complexity results in systems and control - Blondel, Tsitsiklis
70	Analog Computation Via Neural Networks - Siegelmann, Sontag - 1994
66	Real algebraic and semi-algebraic sets - Benedetti, Risler - 1990
48	Interconnected automata and linear systems: A theoretical framework in discrete-time - Sontag - 1996
46	Computability with low-dimensional dynamical systems, Theoretical Computer Science A 132 - Koiran, Cosnard, et al. - 1994
32	Generalized shifts: unpredictability and undecidability in dynamical systems Nonlinearity 4 - Moore - 1991
27	Complexity of stability and controllability of elementary hybrid systems - Blondel, Tsitsilkis - 1999
23	The undecidability of the Turing machine immortality problem - Hooper - 1966
20	From linear to nonlinear: Some complexity questions - Sontag - 1995
17	Complexité algorithmique des systèmes dynamiques continus et hybrides - Bournez - 1999
17	On the computational power of dynamical systems and hybrid systems - Bournez, Cosnard - 1996
15	Deciding stability and mortality of piecewise affine dynamical systems - Blondel, Bournez, et al. - 1999
10	Tsitsiklis, Deciding stability and mortality of piecewise affine systems, Theoretical Computer Science 225 - Blondel, Bournez, et al. - 2003
10	Energy function in neural networks with continuous local functions - Fogelman-Soulie, Mejia, et al. - 1989
6	Overview of complexity and decidability results for three classes of elementary nonlinear systems - Blondel, Tsitsiklis - 1998
3	Tsitsiklis. Three problems on the decidability and complexity of stability - Blondel, N - 1999
1	J.Sifakis,and S.Yovine.The algorithmicanalysisofhybridsystems.TheoreticalComputer - Alur, Courcoubetis, et al.
1	Pnueli.Reachability analysisof dynamicalsystemshaving piecewise-constant derivatives.TheoreticalComputer Science,138(1):35-65,February1995 - Asarin, Maler, et al.
1	J.N.Tsitsiklis.Decidingstability and mortality ofpiecewisea--ne dynamicalsystems.TechnicalReport1999-05,Laboratoire de L'Informatiquedu Parallelisme,EcoleNormaleSuperieurede Lyon,1999.Submitted - Blondel, Koiran
1	Tsitsiklis.Complexity ofstability and controllability ofelementary hybridsystems.A - N
1	Tsitsiklis.Ov erviewofcomplexity and decidability resultsforthree classesofelementarynonlinearsystems.In Y - N
1	Tsitsiklis.A surv ey ofcomputationalcomplexity resultsinsystems and control.To appearinAutomatica,1999 - N
1	Bournez.Complexite algorithmiquedessystemes dynamiquescontinus ethybrides.PhD Thesis,EcoleNormaleSuperieurede Lyon,1999 - unknown authors
1	Shub,and S.Smale.Complexityand RealComputation - Blum, M
1	On a theoryofcomputationand complexity over the realnum bers:NP-completeness,recursive functionsand universalmachines.Bulletinofthe American MathematicalSociety,21(1):1-46,July1989 - Blum, Shub, et al.
1	What's decidableabout hybrid automata?JournalofComputer and SystemSciences,57(1):94-124,August1998 - Henzinger, Kopke, et al.
1	Hooper.The undecidability oftheTuringmachineimmortality problem.The Journal ofSymbolicLogic,31(2),June1966 - K
1	Garzon.Computability withlow-dimensionaldynamicalsystems. TheoreticalComputer Science,132(1-2):113-128,September1994 - Koiran, M
1	Sontag.From lineartononlinear:Some complexity comparisons.InIEEE - D
1	Complexité algorithmique des systèmesdynamiquescontinuset hybrides - Bournez - 1999
1	What’sdecidable about hybrid automata - Henzinger, Kopke, et al. - 1998