BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Parameterized Complexity of some Problems in Concurrency and Verif
 ication - Praveen Manjunatha\, The Institute of Mathematical Sciences\, Ch
 ennai
DTSTART:20110830T130000Z
DTEND:20110830T140000Z
UID:TALK32371@talks.cam.ac.uk
CONTACT:Bjarki Holm
DESCRIPTION:This talk will be about applying graph theoretic parameterized
  complexity notions to some logical decision problems that arise in concur
 rency and verification. First\, we associate a graph with modal logic form
 ulas in Conjunctive Normal Form and give parameterized complexity results 
 for the satisfiability problem with treewidth as parameter. Second\, we as
 sociate a graph with Petri nets\, which are popularly used to model concur
 rent systems. Again\, we give parameterized complexity results for model c
 hecking Petri nets\, using treewidth and other stronger parameters of the 
 associated graph. 
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR