Controllability via chronological calculus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


The chronological formalism, in particular, exponential product expansions and combinatorial features of Viennot-Hall bases are shown to lead to streamlined proofs of conditions for controllability and optimality. The focus is on those high-order conditions for small-time local controllability that originally were derived in the 1980s. The key features are adapted Viennot-Hall bases and Lazard elimination tailored to the specific conditions, which together refine the construction of Sussmann's exponential product expansion.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Number of pages6
StatePublished - 1999
EventThe 38th IEEE Conference on Decision and Control (CDC) - Phoenix, AZ, USA
Duration: Dec 7 1999Dec 10 1999


OtherThe 38th IEEE Conference on Decision and Control (CDC)
CityPhoenix, AZ, USA

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Controllability via chronological calculus'. Together they form a unique fingerprint.

Cite this