Publications

M. Praveen

(With Kamal Lodaya) Parameterized complexity results for 1-safe Petri nets. Accepted in CONCUR 2011, RWTH Aachen University. Full version here.

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. IPEC 2010, The Institute of Mathematical Sciences, Chennai, India. LNCS 6478, pp 216-227.Full version here. Got the IPEC 2010 excellent student paper award.

Does Treewidth help in Modal Satisfiability? MFCS 2010, Faculty of Informatics of Masaryk University in Brno, Czech Republic. LNCS 6281, pp 580-591. Full version here.

(With Kamal Lodaya) Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. FSTTCS 2009, IIT Kanpur. LIPIcs 4 (2009), pp 347-358. Full version here.

(With Kamal Lodaya) Analyzing reachability for some Petri nets with fast growing markings. 2nd RP workshop 2008, Liverpool. ENTCS 223, pp 215-237. Full version here.