Ramchandra Phawade

Assistant Professor

Department of Computer Science and Engineering
Indian Institute of Technology Dharwad
Dharwad, Karnataka, India - 580011. India
Email: prbXiitdhYacYin [@/X,./Y]

Research interests :

Concurrency, Automata Theory and Logic in Computer Science


• Petri nets : connections with product systems, expressions
• Modelling and analysis of timed, concurrent systems using Petri nets
• Formal verification of Timed systems

Academic Background

In 2017 Completed two years of Postdoc at IIT Bombay
In 2015 Obtained PhD in Theoretical Computer Science from The Institute of Mathematical Sciences (IMSc), Chennai
In 2007 Obtained MSc in Computer Science from Chennai Mathematical Institute (CMI), Chennai
In 2002 Obtained BTech in Computer Science and Engineering from National Institute of Technology (NIT), Calicut

Graduate Students working with me:

• Tephilla Prince
is a PhD scholar working with me and S. Sheerazuddin on BMC of infinite state systems using Petri nets and local logics.

• Rajdeep Baruri is looking at verification of Multi-agent systems in his PhD.
  
• Nitish Kumar is working on implementation of completeness parameters of BMC for temporal logics for his Masters Thesis (MS).
  

Publications:

• DBLP listing

• (with S. Akshay and Lo\"ic H\'elu\"et), Combining free choice and time in Petri nets, in Journal of Logical and Algebraic Methods in Programming, vol. 110, Elsevier, (2020) (draft)
  

• Kleene Theorems for Free Choice Automata over Distributed Alphabets, in T. Petri Nets and Other Models of Concurrency, LNCS, vol. 14: 146-171, Springer (2019) (full version here)
  

• (with Kamal Lodaya), Kleene theorems for synchronous products with matching, in Transactions on Petri Nets and Other models of Concurrency, LNCS, vol. 9410:84--108, Springer (2015). click here for pdf
  

• (with Devendra Bhave, SN Krishna and Ashutosh Trivedi), On Timed Scope-bounded Context-sensitive Languages, in 23rd DLT, LNCS, vol. 11647, Springer, Warsaw, 2019, pp. 168--181. Full version here
  

• Kleene theorem for free choice nets labelled with distributed alphabets, in 12th PNSE, CEUR-WS/Vol-2138, Bratislava, 2018, 77--98.

• Kleene theorem for labelled free choice nets without distributed choice, in 10th PNSE, CEUR-WS, vol. 1591, Toru\'n, 2016, pp. 132--152. Full version here
  

• (with S. Akshay and Lo\"ic H\'elu\"et), Combining free choice and time in Petri nets, in 23rd TIME, Denmark, 2016. Full version here
  

• (with Devendra Bhave, Vrunda Dave, SN Krishna and Ashutosh Trivedi), A Perfect Class of Context-Sensitive Timed Languages, in 20th DLT, LNCS, vol. 9840, Springer, Montre\'al, 2016, pp. 38--50. Full version here
  

• (with Devendra Bhave, Vrunda Dave, SN Krishna and Ashutosh Trivedi), A Logical Characterization for Dense-Time Visibly Pushdown Automata, in 10th LATA, LNCS, vol. 9618, Springer, Prague, 2016, pp. 89--101. Full version here
  

• (with Kamal Lodaya), Kleene theorems for labelled free choice nets, in 8th PNSE, CEUR-WS, vol. 1160, Tunis, 2014, pp. 75--89. click here for pdf
  

• (with Kamal Lodaya and Madhavan Mukund), Kleene theorems for product systems, in 13th DCFS, LNCS, vol. 6808, Springer, Limburg, 2011, pp. 235--247. click here for pdf
  

• (with Devendra Bhave), Ramsey-based Universality checking for Dense stack Visibly Pushdown Automata.

• (with Tephilla Prince and S. Sheerazuddin), Bounded Model Checking for Unbounded Client-server Systems click here for pdf
  

Scheduled Teaching in semester (Autumn/Kharif 2023)