R
Ramchandra Phawade
Researcher at Indian Institute of Technology Bombay
Publications - 15
Citations - 63
Ramchandra Phawade is an academic researcher from Indian Institute of Technology Bombay. The author has contributed to research in topics: Decidability & Class (set theory). The author has an hindex of 5, co-authored 14 publications receiving 56 citations. Previous affiliations of Ramchandra Phawade include Institute of Mathematical Sciences, Chennai & Indian Institutes of Technology.
Papers
More filters
Book ChapterDOI
A Logical Characterization for Dense-Time Visibly Pushdown Automata
Devendra Bhave,Vrunda Dave,Shankara Narayanan Krishna,Ramchandra Phawade,Ashutosh Trivedi,Ashutosh Trivedi +5 more
TL;DR: Dense-time visibly pushdown automata that make both the call-return as well as resets visible are introduced and MSO logic characterization is presented and the decidability of the emptiness problem for these automata is proved, paving way for verification problem for dense-timed pushdown Automata specification.
Book ChapterDOI
Kleene theorems for product systems
TL;DR: Kleene theorems are proved for two subclasses of labelled product systems which are inspired from well-studied sub Classes of 1- bounded Petri nets and a corresponding class of expressions is defined.
Kleene Theorems for Labelled Free Choice Nets.
Ramchandra Phawade,Kamal Lodaya +1 more
TL;DR: A “pairing” property in the syntax of this paper allows us to connect to a broader class of product systems, where the conflict-equivalence is not statically fixed.
Book ChapterDOI
A Perfect Class of Context-Sensitive Timed Languages
TL;DR: A perfect subclass of timed context-sensitive languages called dense-time multistack visibly pushdown languages is characterized and a logical characterization for this class of timed languages is provided.
Book ChapterDOI
Kleene Theorems for Synchronous Products with Matching
Ramchandra Phawade,Kamal Lodaya +1 more
TL;DR: A "pairing" property in the syntax of this paper allows us to connect to a broader class of synchronous product systems with a "matching"property, where the conflict-equivalence is not statically fixed.