There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 11

Record: found
Abstract: not found
Article: not found

A survey of computational complexity results in systems and control

Vincent D Blondel, John Tsitsiklis (2000)

0 comments Cited 114 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

A Complete Method for the Synthesis of Linear Ranking Functions

Andreas Podelski, Andrey Rybalchenko (2004)

0 comments Cited 68 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Symbolic Reachability Computation for Families of Linear Vector Fields

Gerardo Lafferriere, George Pappas, Sergio Yovine (2001)

0 comments Cited 37 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2004

Pages: 70-82

DOI: 10.1007/978-3-540-27813-9_6

SO-VID: 06e12ab1-baf2-4e5d-ba82-f77f1ab32f38

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 25

Termination of Integer Linear Programs
Authors: Mark Braverman
Termination of Polynomial Programs
Authors: Aaron R. Bradley, Zohar Manna, Henny B. Sipma
The Polyranking Principle
Authors: Aaron R. Bradley, Zohar Manna, Henny B. Sipma

See all cited by

Termination of Linear Programs

Read this book at

Related collections

ScienceOpen Research

Most cited references 11

A survey of computational complexity results in systems and control

A Complete Method for the Synthesis of Linear Ranking Functions

Symbolic Reachability Computation for Families of Linear Vector Fields

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,457

Cited by 25