P
Paulo Tabuada
Researcher at University of California, Los Angeles
Publications - 300
Citations - 25801
Paulo Tabuada is an academic researcher from University of California, Los Angeles. The author has contributed to research in topics: Control system & Control theory. The author has an hindex of 60, co-authored 288 publications receiving 20444 citations. Previous affiliations of Paulo Tabuada include University of California, Berkeley & Instituto Superior Técnico.
Papers
More filters
Book ChapterDOI
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
TL;DR: The main contribution of this paper consists in showing that under standard assumptions ensuring incremental stability of a switched system, it is possible to construct a symbolic model that is approximately bisimilar to the original switched system with a precision that can be chosen a priori.
Journal ArticleDOI
Data driven stability analysis of black-box switched linear systems
TL;DR: In this paper, the authors show that, for any given random set of observations, one can give probabilistic stability guarantees, and provide an explicit way of computing the best stability-like guarantee, as a function of both the number of observations and the required level of confidence.
Journal ArticleDOI
Symbolic approximate time-optimal control
Manuel Mazo,Paulo Tabuada +1 more
TL;DR: This paper investigates the use of symbolic models for time-optimal controller synthesis by considering systems related by approximate (alternating) simulation relations and showing how such relations enable the transfer of time-optimality information between the systems.
Proceedings ArticleDOI
Sound and complete state estimation for linear dynamical systems under sensor attacks using Satisfiability Modulo Theory solving
Yasser Shoukry,Alberto Puggelli,Pierluigi Nuzzo,Alberto Sangiovanni-Vincentelli,Sanjit A. Seshia,Paulo Tabuada +5 more
TL;DR: A novel, efficient algorithm is developed that uses a Satisfiability Modulo Theory approach to isolate the compromised sensors and estimate the system state despite the presence of the attack, thus harnessing the intrinsic combinatorial complexity of the problem.
Proceedings ArticleDOI
Minimax control for cyber-physical systems under network packet scheduling attacks
TL;DR: The extent to which an adversary can attack a physical system by tampering with the temporal characteristics of the network, leading to time-varying delays and more importantly by changing the order in which packets are delivered is studied.