M. Praveen
M. Praveen
Assistant professor, Chennai Mathemaitical Institute
Verified email at cmi.ac.in - Homepage
Title
Cited by
Cited by
Year
Reasoning about data repetitions with counter systems
S Demri, D Figueira, M Praveen
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 33-42, 2013
362013
Hyper-Ackermannian bounds for pushdown vector addition systems
J Leroux, M Praveen, G Sutre
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conferenceá…, 2014
242014
ω-Petri nets
G Geeraerts, A Heu▀ner, M Praveen, JF Raskin
International Conference on Applications and Theory of Petri Nets andá…, 2013
112013
Does treewidth help in modal satisfiability?
M Praveen
ACM Transactions on Computational Logic (TOCL) 14 (3), 1-32, 2013
102013
Analyzing reachability for some Petri nets with fast growing markings
M Praveen, K Lodaya
Electronic Notes in Theoretical Computer Science 223, 215-237, 2008
92008
Extending the Rackoff technique to affine nets
R Bonnet, A Finkel, M Praveen
IARCS Annual Conference on Foundations of Software Technology andá…, 2012
82012
ω-Petri nets: Algorithms and complexity
G Geeraerts, A Heu▀ner, M Praveen, JF Raskin
Fundamenta Informaticae 137 (1), 29-60, 2015
72015
A relational trace logic for vector addition systems with application to context-freeness
J Leroux, M Praveen, G Sutre
International Conference on Concurrency Theory, 137-151, 2013
72013
Parameterized complexity results for 1-safe Petri nets
M Praveen, K Lodaya
International Conference on Concurrency Theory, 358-372, 2011
62011
Small vertex cover makes petri net coverability and boundedness easier
M Praveen
International Symposium on Parameterized and Exact Computation, 216-227, 2010
52010
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
M Praveen, K Lodaya
IARCS Annual Conference on Foundations of Software Technology andá…, 2009
52009
Complexity of the reachability problem in subclasses of Petri nets
M Praveen
Master's thesis, Homi Bhabha National Institute, 2008
52008
Playing with repetitions in data words using energy games
D Figueira, M Praveen
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computerá…, 2018
42018
Verification of flat FIFO systems
A Finkel, M Praveen
arXiv preprint arXiv:1908.07282, 2019
32019
Does treewidth help in modal satisfiability?
M Praveen
International Symposium on Mathematical Foundations of Computer Science, 580-591, 2010
32010
Logic, Courcelle’s theorem and application
M Praveen
IMPECS School on Parameterized and Exact Computation (December 2010), 2010
22010
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
J Leroux, M Praveen, P Schnoebelen, G Sutre
arXiv preprint arXiv:1904.04090, 2019
12019
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity
M Praveen, B Srivathsan
arXiv preprint arXiv:1603.00658, 2016
12016
Parameterized complexity of some problems in concurrency and verification
M Praveen
Mumbai, 2011
12011
Verification of Flat FIFO Systems
M Praveen, A Finkel
Logical Methods in Computer Science 16, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20