University of Cambridge > Talks.cam > CUED Control Group Seminars > Computable analysis and control synthesis of complex dynamical systems via formal verification

Computable analysis and control synthesis of complex dynamical systems via formal verification

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Tim Hughes.

This talk looks at the development of abstraction techniques based on quantitative approximations, in order to formally verify complex systems and to provide computable approaches for the correct-by-design synthesis of control architectures. The approach employs techniques and concepts from the formal verification area, such as that of (approximate probabilistic) bisimulation, over models and problems from the field of systems and control. While emphasising the generality of the approach over a diverse set of model classes, this talk zooms in on stochastic hybrid systems, which are probabilistic models with heterogeneous dynamics (continuous/discrete, i.e. hybrid, as well as nonlinear). A case study in energy networks, dealing with the problem of demand response, is employed to clarify concepts and techniques. Theory is complemented by algorithms, all packaged in software tools (called FAUST ^2 for stochastic models) that are freely available to users.

This talk is part of the CUED Control Group Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity