C
Christophe Prieur
Researcher at University of Grenoble
Publications - 381
Citations - 7005
Christophe Prieur is an academic researcher from University of Grenoble. The author has contributed to research in topics: Exponential stability & Lyapunov function. The author has an hindex of 40, co-authored 348 publications receiving 5908 citations. Previous affiliations of Christophe Prieur include Laboratory for Analysis and Architecture of Systems & University of Paris-Sud.
Papers
More filters
Journal ArticleDOI
Boundary observers for linear and quasi-linear hyperbolic systems with application to flow control
TL;DR: This paper derives some sufficient conditions for exponential boundary observer design using only the information from the boundary control and the boundary conditions by means of Lyapunov based techniques.
Proceedings Article
Squaring transducers: An efficient procedure for deciding functionality and sequentiality
TL;DR: In this paper, it is shown that it is decidable whether a transducer realizes a functional relation and whether a finite transduger realizes a sequential relation. But the decidability of these two decision procedures on transducers is still open.
Journal ArticleDOI
Stabilization of linear impulsive systems through a nearly-periodic reset
TL;DR: In this article, the authors deal with the class of impulsive systems constituted by a continuous-time linear dynamics for all time, except at a sequence of instants, where the state undergoes a jump, or more precisely follows a discrete linear dynamics.
Journal ArticleDOI
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
TL;DR: A construction on transducers is described that gives a new conceptual proof for two classical decidability results ontransducers: it is decidable whether a finite transducer realizes a functional relation, and whether a infinite transducers realizes a sequential relation.
Journal ArticleDOI
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
TL;DR: It is decidable whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential, and the proof is constructive.