Ramchandra Phawade
Assistant Professor
Contact
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
Publications:
Journal Publications:
- (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, Elsevier, 2018.
(Accepted, In press)
- (with Kamal Lodaya),
Kleene theorems for synchronous products with matching, in
Transactions on Petri Nets and Other models of Concurrency,
LNCS, vol. 9410, Springer, 2015, pp. 84--108.
click here for pdf
Conference Publications:
- (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
Pre-prints: (available on request)
- (with Devendra Bhave),
Ramsey-based Universality checking for Dense stack Visibly Pushdown Automata.
Teaching in current semester (Autumn 2019)
Software Systems Lab (CS 213)--8 credit course.
Courses taught from August 2017 to Summer 2019
Automata Theory (CS 202)-- 6 credit course.
Design and Analysis of Algorithms (CS 218)-- 6 credit course--Spring 2019
Formal Models for concurrent and asynchronous systems (Grad Course)-- 6 credit course--Spring 2019
Special topics in automata and logics (Grad Course)-- 6 credit course-- Spring 2019
Software Systems Lab (CS 213)--8 credit course -- Autumn 2018.
Logic and its applications (Grad Course)---- 6 credits--Autumn 2018.
Engineering Mathematics for Advanced studies (Grad Course)-- 1 credit--Autumn 2018.
Software Systems Lab (CS 251)--8 credit course -- (at IIT Goa) -- 44 hours -- Autumn 2017.
Design and Analysis of Algorithms (CS 218)-- 6 credit course -- 43 hours -- Spring 2018.
Engineering Mathematics for Advanced studies (Grad Course)-- 1 credit -- 6 hours -- Spring 2018.
Computer Programming and Utilization (CS 101) --2.75 credits -- 12 hours -- Summer 2018
Applications of Petri nets:
Some areas they used in are:
communication protocols and networks,
software, workflow and business processes,
hardware, control systems and military systems. Few pointers are given
below.
Success stories on Petri nets world,
Industrial applications of Colored Petri nets,
A paper by Van Der Aalst.
General Links
Last modified: Wed May 08 10:15:02 IST 2019