BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1493
DTSTAMP:20241107T061825Z
SUMMARY:LocPastPDL: An expressively complete logic over Mazurkiewicz traces
  and its applications to concurrency theory
DESCRIPTION:Speaker: Shantanu Kulkarni (IIT Bombay)\n\nAbstract: \nThis tal
 k is based on our work in LiCS 2024: https://dl.acm.org/doi/abs/10.1145/3
 661814.3662110. In the talk I will first introduce the setting of concurre
 nt computation via asynchronous automata on Mazurkiewikz traces\, I will t
 hen get into the syntax and semantics of our logic “LocPastPDL”. I wil
 l talk about its applications for formal verification of concurrent system
 s and for proving a Krohn-Rhodes style decomposition theorem for regular l
 anguages over Mazurkiewicz traces. Finally if time permits I will go into 
 the proof sketch of our main result which is ‘LocPastPDL is expressively
  complete with respect to regular trace languages.’\n
URL:https://www.tcs.tifr.res.in/web/events/1493
DTSTART;TZID=Asia/Kolkata:20241108T160000
DTEND;TZID=Asia/Kolkata:20241108T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR