Termination of linear programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3114, Issue , 2004, Pages 70-82

  Tiwari, Ashish ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; LINEAR PROGRAMMING; LINEAR SYSTEMS; STRUCTURED PROGRAMMING;

DISCRETE TIME LINEAR SYSTEMS; LINEAR ASSIGNMENT; LINEAR PROGRAMS; LOOP CONDITIONS; POSITIVE REAL; SIMPLE LOOP; STABILITY THEOREMS; WHILE LOOPS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 35048871890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_6     Document Type: Article

References (17)

1. D. K. Arrowsmith and C. M. Place. An introduction to dynamical systems. Cambridge, 1990.
2. L. Bachmair and N. Dershowitz. Commutation, transformation, and termination. In J. H. Siekmann, editor, Proc. 8th Int. Conf. on Automated Deduction, volume 230 of LNCS, pages 5-20, Berlin, 1986. Springer-Verlag.
3. V. D. Blondel, O. Bournez, P. Koiran, C. H. Papadimitriou, and J. N. Tsitsiklis. Deciding stability and mortality of piecewise affine dynamical system. Theoretical Computer Science, 255(1-2):687-696, 2001.
4. V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control. Automatica, 36:1249-1274, 2000.
5. M. Colon and H. Sipma. Synthesis of linear ranking functions. In T. Margaria and W. Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, 7th Intl. Conf. TACAS 2001, volume 2031 of LNCS, pages 67-81. Springer, 2001.
6. M. Colon and H. Sipma. Practical methods for proving program termination. In E. Brinksma and K. G. Larsen, editors, Computer Aided Verification, 14th Intl. Conf. CAV 2002, volume 2034 of LNCS, pages 442-454. Springer, 2002.
7. D. Dams, R. Gerth, and O. Grumberg. A heuristic for the automatic generation of ranking function. In Workshop on Advances in Verification WAVe 2000, pages 1-8, 2000.
8. E. W. Dijkstra. A Discipline of Programming. Prentice Hall PTR, 1997.
9. K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, second edition, 1971.
10. R. Kannan and R. J. Lipton. Polynomial-time algorithm for the orbit problem. J. of the ACM, 33(4):808-821, 1986.
11. G. Lafferriere, G. J. Pappas, and S. Yovine. Symbolic reachability computations for families of linear vector fields. J. Symbolic Computation, 32(3):231-253, 2001.
12. J. Musset and M. Rusinowitch. Computing metatransitions for linear transition systems. In 12th Intl. FME symposium, 2003.
13. A. Podelski and A. Rybalchenko. A complete method for synthesis of linear ranking functions. In VMCAI 2004: Verification, Model Checking, and Abstract Interpretation, LNCS. Springer-Verlag, 2004.
14. A. Podelski and A. Rybalchenko. Transition invariants. In Logic in Computer Science, LICS. IEEE Computer Society, 2004.
15. D. R. Smart. Fixed Point Theorems. Cambridge University Press, 1980.
16. E. Sontag. From linear to nonlinear: Some complexity comparisons. In 34th IEEE Conf. on Decision and Control, CDC, 1995.
17. A. Tiwari. Approximate reachability for linear systems. In O. Maler and A. Pnueli, editors, Hybrid Systems: Computation and Control HSCC, volume 2623 of LNCS, pages 514-525. Springer, April 2003.