Follow
Ramchandra Phawade
Ramchandra Phawade
Assistant Professor, Dept of Computer Science and Engineering, IIT Dharwad
Verified email at iitdh.ac.in - Homepage
Title
Cited by
Cited by
Year
A logical characterization for dense-time visibly pushdown automata
D Bhave, V Dave, SN Krishna, R Phawade, A Trivedi
Language and Automata Theory and Applications: 10th International Conference …, 2016
112016
Kleene theorems for product systems
K Lodaya, M Mukund, R Phawade
International Workshop on Descriptional Complexity of Formal Systems, 235-247, 2011
102011
A perfect class of context-sensitive timed languages
D Bhave, V Dave, SN Krishna, R Phawade, A Trivedi
Developments in Language Theory: 20th International Conference, DLT 2016 …, 2016
72016
Kleene Theorems for Labelled Free Choice Nets.
R Phawade, K Lodaya
PNSE@ Petri Nets, 75-89, 2014
72014
Kleene theorems for synchronous products with matching
R Phawade, K Lodaya
Transactions on Petri nets and other models of concurrency X, 84-108, 2015
62015
Combining free choice and time in Petri nets
S Akshay, L Hélouët, R Phawade
Journal of Logical and Algebraic Methods in Programming 110, 100426, 2020
52020
Labelled free choice nets, finite product automata, and expressions
R Phawade
Ph. D. thesis, Homi Bhabha National Institute, 2015
52015
On timed scope-bounded context-sensitive languages
D Bhave, SN Krishna, R Phawade, A Trivedi
Developments in Language Theory: 23rd International Conference, DLT 2019 …, 2019
42019
Kleene Theorem for Labelled Free Choice Nets without Distributed Choice.
R Phawade
PNSE@ Petri Nets, 132-152, 2016
32016
Bounded model checking for unbounded client server systems
R Phawade, T Prince, S Sheerazuddin
arXiv preprint arXiv:2209.05879, 2022
12022
Kleene Theorems for Free Choice Nets Labelled with Distributed Alphabets
R Phawade
arXiv preprint arXiv:1907.01168, 2019
12019
Kleene theorems for free choice automata over distributed alphabets
R Phawade
Transactions on Petri Nets and Other Models of Concurrency XIV, 146-171, 2019
12019
Ramsey-Based Inclusion Checking for Dense-Stack Visibly Pushdown Automata
D Bhave, R Phawade
Kleene Theorems for Labelled Free Choice Nets without product acceptance condition
R Phawade
The system can't perform the operation now. Try again later.
Articles 1–14