IARCS Verification Seminar Series -- Talk by Suman Sadhukhan on November 20 at 1500 hrs IST
Dear all, The next talk in the IARCS Verification Seminar Series will be given by Suman Sadhukhan, a post-doctoral researcher at Technische Universität Clausthal. The talk is scheduled on Friday, November 20, at 1500 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=N21kOW5pbXQwaTMwY2RmZXQ0cG5tNmk5NzcgdnNzLmlhcmNzQG0&tmsrc=vss.iarcs%40gmail.com> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/), and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Organizers, IARCS Verification Seminar Series ============================================================= Title: Decoupled Planning for Multiple Omega-Regular Objectives Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Suppose we need to generate a path on a graph that satisfies several omega-regular objectives at once. The standard approach is to build one monolithic plan for their conjunction. But what if one of the objectives is replaced, or a new one is added? Do we have to redesign the plan from scratch? In this talk, we will explore a more modular alternative: give each objective to its own agent, let each agent pick a local policy, and let a scheduler, who knows nothing about the graph or the objectives, decide on the fly whose policy to follow at each step. The question we focus on is the following: assuming the conjunction of all objectives is realizable, when does this kind of composition actually satisfy all of them? We will see that even extremely fair scheduling alone, even with randomization, is in general insufficient without some coordination between the agents. For safety objectives, we introduce a protocol for synchronizing on maximal safe actions. For non-safety objectives, we introduce conventions (simple rules agreed on before the graph or objectives are known) that guarantee all objectives are met. We characterise minimally restrictive conventions for major subclasses of omega-regular objectives. This is a joint work with Guy Avni, Thomas A. Henzinger, Kaushik Mallik, and K S Thejaswini, published at CAV 2026. Bio: Suman Sadhukhan is currently a post-doctoral researcher at Technische Universität Clausthal, hosted by Rüdiger Ehlers since April 2026. Prior to this, I was a postdoc at University of Haifa, with Guy Avni. He obtained his PhD in 2022 from Inria Rennes where he was advised by Nathalie Bertrand, Nicolas Markey and Ocan Sankur, and worked on dynamic network congestion games from a verification perspective. He is interested in, but not restricted to, Games on Graphs, studying different game theoretic models from formal verification and reactive synthesis viewpoint. Prior to his PhD training, he was a student at Chennai Mathematical Institute where he studied Theoretical Computer Science and Mathematics.
participants (1)
-
VSS IARCS