Power of Randomization in Finite State Monitoring
Event details
| Date | 09.06.2015 |
| Hour | 10:00 |
| Speaker | Mahesh Viswanathan, University of Illinois Urbana-Champaign (USA) |
| Location | |
| Category | Conferences - Seminars |
The continuous run-time monitoring of the behavior of a system is a technique that is used both as a complementary approach to formal verification and testing to ensure reliability, as well as a means to discover emergent properties in a distributed system, like intrusion and event correlation. The monitors in all these scenarios can be abstractly viewed as automata that process a (unbounded) stream of events to and from the component being observed, and raise an ``alarm'' when an error or intrusion is discovered. These monitors indicate the absence of error or intrusion in a behavior implicitly by the absence of an alarm.
In this talk, we will investigate the power of randomization in run-time monitoring. Specifically, 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 present translations from logics to such automata, and discuss their applications to decision problems for temporal logics.
This joint work with Rohit Chadha, Dileep Kini, and A. Prasad Sistla.
In this talk, we will investigate the power of randomization in run-time monitoring. Specifically, 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 present translations from logics to such automata, and discuss their applications to decision problems for temporal logics.
This joint work with Rohit Chadha, Dileep Kini, and A. Prasad Sistla.
Links
Practical information
- General public
- Free
Organizer
- Viktor Kuncak
Contact
- Sylvie Thomet