M. Praveen
 (With Kamal Lodaya) Petri nets with small paths
property, In Workshop on Automata,
Concurrency and Timed Systems, January 2009
at Chennai Mathematical
Institute, India.
 (With Kamal Lodaya) A tutorial on the proof of decidability of the Petri net reachability problem,
In Formal Methods Update Meeting,
July 2009 at IIT Roorkee, India.
 Logic, Courcelle's
theorem and Applications,
In IMPECS school on Parameterized and
Exact Computation, December 2010 at
IMSc, India.

Lectures on Jérôme
Leroux’s Proof of Decidability
of Reachability in Vector Addition
Systems, at CMI in April
2014. Here are some notes I prepared by
reordering the contents of the original paper Vector Addition
System Reachability Problem: A Short SelfContained
Proof.