BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Power of Randomization in Finite State Monitoring
DTSTART:20150609T100000
DTSTAMP:20260930T223231Z
UID:6d820a50841e9d0d8f652ff8f00b0005c7c5c94c59c98d1ca8ed1d5a
CATEGORIES:Conferences - Seminars
DESCRIPTION:Mahesh Viswanathan\, University of Illinois Urbana-Champaign (
 USA)\nThe continuous run-time monitoring of the behavior of a system is a 
 technique that is used both as a complementary approach to formal verifica
 tion and testing to ensure reliability\, as well as a means to discover em
 ergent properties in a distributed system\, like intrusion and event corre
 lation. The monitors in all these scenarios can be abstractly viewed as au
 tomata that process a (unbounded) stream of events to and from the compone
 nt being observed\, and raise an ``alarm'' when an error or intrusion is d
 iscovered. These monitors indicate the absence of error or intrusion in a 
 behavior implicitly by the absence of an alarm.\nIn this talk\, we will in
 vestigate the power of randomization in run-time monitoring.  Specificall
 y\, we examine finite memory monitoring algorithms that toss coins to make
  decisions on the behavior they are observing. We give a number of results
  that characterize the computational power of such monitors. We will prese
 nt translations from logics to such automata\, and discuss their applicati
 ons to decision problems for temporal logics.\nThis joint work with Rohit 
 Chadha\, Dileep Kini\, and A. Prasad Sistla.
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR