Sriram sankaranarayanan thesis

Current foundational topics of interest include: Reachability and stability verification of hybrid dynamical systems. To do so, it uses a notion of robustness that measures how far away a continuous-time or a mixed discretecontinuous-time signal is from violating a property of interest.

Sriram Sankaranarayanan: Research Research Introduction My primary interests lie in the computational analysis of Cyber-Physical Systemsthat involve the interaction of software components inside a physical system.

As part of this work, we have developed techniques using martingale theory and concentration of measure inequalities for reasoning about programs that process uncertain random inputs. A successor to StInG with new and improved solution algorithms is planned sometime in S-Taliro is a Matlab toolbox that searches for counter-examples to properties in complex Cyber-Physical Systems.

computer science dept cu boulder

It is being developed jointly in collaboration with Drs. LPINV is a template-polyhedron abstract interpretation tool.

Sriram sankaranarayanan jhu

It is being developed jointly in collaboration with Drs. Probabilistic Program Verification project is a past NSF-funded project wherein we are developing ideas for verifying stochastic systems. To do so, it uses a notion of robustness that measures how far away a continuous-time or a mixed discretecontinuous-time signal is from violating a property of interest. It combines a graph-based abstraction technique with on-the-fly explicit model checking for property violations. Further, we use this branch of nonconvex problems in the Ethiopian food market to analyze the regional effects of exogenous shocks on the market. For mixed-integer bilevel programming, we develop algorithms that run in polynomial time, provided a subset of the input parameters are fixed. Current foundational topics of interest include: Reachability and stability verification of hybrid dynamical systems. All these optimization problems are central to the verification and synthesis of Cyber-Physical Systems. A successor to StInG with new and improved solution algorithms is planned sometime in Artificial Pancreas Verification Project is a collaboration between engineers, computer scientists, mathematicians, and clinical researchers centered around the mathematical modeling, simulation and formal analysis of the artificial pancreas concept. My research addresses foundational theoretical issues including the theory of hybrid dynamical systems as well as applications to closed-loop medical devices and automotive systems. Research Group. We then use the technique to analyze policies related to the North American natural gas market.

The method can be used to approximate the covariance for large-scale problems by solving a system of linear equations. Further, we use this branch of nonconvex problems in the Ethiopian food market to analyze the regional effects of exogenous shocks on the market.

It is no longer maintained. Given a mathematical model of a nonlinear hybrid dynamical system, a set of initial states and set of input signals, the tool computes a safe overapproximation of the reachable set of states over time.

Probabilistic Program Verification project is a past NSF-funded project wherein we are developing ideas for verifying stochastic systems.

University of colorado cs faculty

Correct-by-construction synthesis of control systems. Current foundational topics of interest include: Reachability and stability verification of hybrid dynamical systems. A successor to StInG with new and improved solution algorithms is planned sometime in We then use the technique to analyze policies related to the North American natural gas market. We also show that the feasible region of any mixed-integer bilevel program is a union of the feasible regions of finitely many mixed-integer programs up to projections and closures. The challenges include mathematical modeling of enviromental uncertainties, reasoning about these mathematical models to automatically prove or falsify correctness properties, and synthesizing core software subsystems automatically from given correctness specifications. Guaranteed nonlinear solvers project seeks the combination of numeric and symbolic nonlinear optimization tools for solving verification and synthesis problems. It is no longer maintained. Optimization and decision problems such as guaranteed nonlinear optimization and multilinear problems. For complementarity problems, we develop a first-order approximation algorithm to efficiently approximate the covariance of the decision in a stochastic complementarity problem. LPINV is a template-polyhedron abstract interpretation tool. Given a closed-loop control system model that can be simulated inside Matlab tm SimulinkStateflow environment and a specified property of the model, S-Taliro systematically searches for violations. Further, we use this branch of nonconvex problems in the Ethiopian food market to analyze the regional effects of exogenous shocks on the market. The method can be used to approximate the covariance for large-scale problems by solving a system of linear equations. All these optimization problems are central to the verification and synthesis of Cyber-Physical Systems.
Rated 10/10 based on 102 review
Download
Home: Aleksandar Chakarov