BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:US/Central
BEGIN:DAYLIGHT
DTSTART:20180311T030000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180503T000000Z
UID:8F88C852-4FCC-4170-8D9A-48DBD324EF16
DTSTART;TZID=US/Central:20180302T130000
DTEND;TZID=US/Central:20180302T140000
DESCRIPTION:Speaker: Murat Arcak\, Professor\, EECS\, University of Califor
 nia\, Berkeley\n\nTitle: Compositional certification of stability\, perfor
 mance\, and safety for interconnected systems\n\nAbstract: A major problem
  for today’s large-scale networked systems is to certify the required st
 ability\, performance\, and safety properties using analytical and computa
 tional models. The existing methods for such certification are severely li
 mited in their ability to cope with the number of physical components and 
 the complexity of their interactions We address this problem with a compos
 itional approach that derives network-level guarantees from key structural
  properties of the subsystems and their interactions\, rather than tackle 
 the system model as a whole. The foundational tool in our approach is the 
 established dissipativity theory\, enriched with modern computational tech
 niques. Dissipativity properties serve as abstractions of the detailed dyn
 amical models of the subsystems and allow us to decompose intractably larg
 e certification problems into subproblems of manageable size. We leverage 
 large-scale optimization techniques to detect useful dissipativity propert
 ies and exploit interconnection symmetries for further computational savin
 gs. Case studies demonstrate the applicability of the methods to biologica
 l networks\, vehicle platoons\, and Internet congestion control.\n\nSpeake
 r(s): Murat Arcak\, Professor EECS\, University of California\, Berkeley\,
  \n\nRoom: 3043\, Bldg: Coover Hall\, Electrical and Computer Engineering\
 , Ames\, Iowa\, United States
LOCATION:Room: 3043\, Bldg: Coover Hall\, Electrical and Computer Engineeri
 ng\, Ames\, Iowa\, United States
ORGANIZER:rkumar@iastate.edu
SEQUENCE:4
SUMMARY:Compositional certification of stability\, performance\, and safety
  for interconnected systems
URL;VALUE=URI:https://events.vtools.ieee.org/m/161290
X-ALT-DESC:Description: &lt;br /&gt;&lt;p&gt;&lt;strong&gt;Speaker:&amp;nbsp\;&lt;/strong&gt;Murat Arca
 k\, Professor\, EECS\, University of California\, Berkeley&lt;/p&gt;\n&lt;p&gt;&lt;strong
 &gt;Title:&amp;nbsp\;&lt;/strong&gt;Compositional certification of stability\, performa
 nce\, and safety for interconnected systems&lt;/p&gt;\n&lt;p&gt;&lt;strong&gt;Abstract:&amp;nbsp
 \;&lt;/strong&gt;A major problem for today&amp;rsquo\;s large-scale networked system
 s is to certify the required stability\, performance\, and safety properti
 es using analytical and computational models.&amp;nbsp\; The existing methods 
 for such certification are severely limited in their ability to cope with 
 the number of physical components and the complexity of their interactions
 &amp;nbsp\; We address this problem with a compositional approach that derives
  network-level guarantees from key structural properties of the subsystems
  and their interactions\, rather than tackle the system model as a whole.&amp;
 nbsp\; The foundational tool in our approach is the established dissipativ
 ity theory\, enriched with modern computational techniques.&amp;nbsp\; Dissipa
 tivity properties serve as abstractions of the detailed dynamical models o
 f the subsystems and allow us to decompose intractably large certification
  problems into subproblems of manageable size. We leverage large-scale opt
 imization techniques to detect useful dissipativity properties and exploit
  interconnection symmetries for further computational savings. Case studie
 s demonstrate the applicability of the methods to biological networks\, ve
 hicle platoons\, and Internet congestion control.&amp;nbsp\;&lt;/p&gt;
END:VEVENT
END:VCALENDAR

