2:00 pm, Seminar Hall
Model checking distributed probabilistic systems
National University of Singapore.
The formal verification of large probabilistic models is challenging. Exploiting the concurrency that is often present is one way to address this problem. We would primarily discuss about a class of communicating probabilistic agents which can be viewed as a succinct and distributed presentation of a large global Markov chain. In this talk we will give a brief overview of the model and the relevant model checking techniques, and discuss at length about potential advancements and application domains. This talk will be nontechnical in nature and is aimed at students and researchers interested in model checking and probabilistic systems.