BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Verification of distributed probabilistic systems under partial in
 formation
DTSTART:20170308T110000
DTEND:20170308T120000
DTSTAMP:20260407T101342Z
UID:4e1d995ad58649222a95722404992af9ee21db4c0c07b4c1ba9c8cc9
CATEGORIES:Conferences - Seminars
DESCRIPTION:by Dr. Sergio Giro\n\nAbstract\nIn the verification of systems
  that involve probabilities\, it is crucial to study qualitative propertie
 s concerning the probability of certain events as\, for instance\, 'the pr
 obability that a failure occurs is less that 0.01'. In case the system und
 er consideration is distributed\, each of the components of the system mig
 ht have a partial view of the information available to other components. T
 he analysis of these systems is carried out by considering 'distributed ad
 versaries' with restricted observations. In this talk I will summarise six
  years of research on automatic verification of distributed probabilistic 
 systems. On the negative side\, we proved the verification problem to be u
 ndecidable in general and NP-complete for some restricted systems. Neverth
 eless\, we also introduced some techniques for overestimation of worst-cas
 e probabilities\, and showed that the concept of distributed adversaries c
 an be used to improve existing techniques such as partial order reduction.
 \n\nBio\nSergio holds an MSc and a PhD in Computer Science\, both obtained
  at National Universities in Argentina\, with a strong focus on formal met
 hods\, logic and compilers. After serving as a Research Assistant in Oxfor
 d University in the area quantitative analysis of distributed systems\, he
  joined Google for 4 years\, working on distributed data processing and an
 alysis applied to a variety of problems including demand forecast\, fraud 
 detection and development of Java security libraries for Android.\n\n\n 
LOCATION:BC 410 https://plan.epfl.ch/?room==BC%20410
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR