Termination of Linear Programs

This publication has 11 references indexed in Scilit:

• A Complete Method for the Synthesis of Linear Ranking Functions
  Published by Springer Nature ,2004
• Approximate Reachability for Linear Systems
  Published by Springer Nature ,2003
• From linear to nonlinear: some complexity comparisons
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Practical Methods for Proving Program Termination
  Published by Springer Nature ,2002
• Symbolic Reachability Computation for Families of Linear Vector Fields
  Journal of Symbolic Computation, 2001
• Deciding stability and mortality of piecewise affine dynamical systems
  Theoretical Computer Science, 2001
• Synthesis of Linear Ranking Functions
  Published by Springer Nature ,2001
• A survey of computational complexity results in systems and control
  Automatica, 2000
• Polynomial-time algorithm for the orbit problem
  Journal of the ACM, 1986
• Commutation, transformation, and termination
  Published by Springer Nature ,1986