Analyzing Reachability for Some Petri Nets With Fast Growing Markings. - M. Praveen; Kamal Lodaya (RP, 2008)

Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. - M. Praveen; Kamal Lodaya (FSTTCS, 2009)

Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). - M. Praveen (MFCS, 2010)

Parameterized Complexity Results for 1-safe Petri Nets. - M. Praveen; Kamal Lodaya (CONCUR, 2011)

A Regularity Measure for Context Free Grammars - M. Praveen (CoRR, 2011)

Extending the Rackoff technique to Affine nets. - Rémi Bonnet; Alain Finkel; M. Praveen (FSTTCS, 2012)

ω-Petri Nets. - Gilles Geeraerts; Alexander Heußner; M. Praveen; Jean-François Raskin (Petri Nets, 2013)

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. - Jérôme Leroux; M. Praveen; Grégoire Sutre (CONCUR, 2013)

Seamless integration of common framework Indian language TTSes in various applications. - Pranaw Kumar; Gandhi Annamalai; T. Sajini; Anand Konjengbam; M. Praveen; G. R. Kasthuri; Anil Prabhakar; Shuo Qiao; Sushanta K. Pani; Vishal Maral; S. L. Binil Kumar; Arun Gopi; et al. (O-COCOSDA/CASLRE, 2013)

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. - M. Praveen (Algorithmica, 2013)

Does Treewidth Help in Modal Satisfiability? - M. Praveen (ACM Trans. Comput. Log., 2013)

Hyper-Ackermannian bounds for pushdown vector addition systems. - Jérôme Leroux; M. Praveen; Grégoire Sutre (CSL-LICS, 2014)

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? - M. Praveen; B. Srivathsan (PODS, 2015)

ω-Petri Nets: Algorithms and Complexity. - Gilles Geeraerts; Alexander Heußner; M. Praveen; Jean-François Raskin (Fundam. Informaticae, 2015)

Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. - M. Praveen; B. Srivathsan (ICALP, 2016)

Reasoning about Data Repetitions with Counter Systems. - Stéphane Demri; Diego Figueira; M. Praveen (Log. Methods Comput. Sci., 2016)

Playing with Repetitions in Data Words Using Energy Games. - Diego Figueira; M. Praveen (LICS, 2018)

Query Preserving Watermarking Schemes for Locally Treelike Databases. - Agnishom Chattopadhyay; M. Praveen (FSTTCS, 2019)

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. - Jérôme Leroux; M. Praveen; Philippe Schnoebelen; Grégoire Sutre (Log. Methods Comput. Sci., 2019)

What You Must Remember When Transforming Datawords. - M. Praveen (FSTTCS, 2020)

Playing with Repetitions in Data Words Using Energy Games. - Diego Figueira; Anirban Majumdar 002; M. Praveen (Log. Methods Comput. Sci., 2020)

Verification of Flat FIFO Systems. - Alain Finkel; M. Praveen (Log. Methods Comput. Sci., 2020)

Checking Regular Invariance Under Tightly-Controlled String Modifications. - C. Aiswarya; Sahil Mhaskar; M. Praveen (DLT, 2022)

Window Expressions for Stream Data Processing. - M. Praveen; S. Hitarth (CoRR, 2022)

Constraint LTL with Remote Access. - Ashwin Bhaskar; M. Praveen (FSTTCS, 2023)

Detection and Classification of 'Myopia Epidemic' Using Image Processing and Machine Learning to Prevent Fatal Road Accidents. - A. E. Narayanan; M. Ishwarya; S. Kaviarasan; M. Praveen; N. Sagana (ICCCNT, 2023)

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol. - M. Praveen; Raghavendra Ramesh; Isaac Doidge (FMBC@CAV, 2024)

On the Piecewise Complexity of Words and Periodic Words. - M. Praveen; Philippe Schnoebelen; Julien Veron; Isa Vialard (SOFSEM, 2024)

Realizability problem for constraint LTL. - Ashwin Bhaskar; M. Praveen (Inf. Comput., 2024)

Parallel Complexity of Depth-First-Search and Maximal path. - Archit Chauhan; Samir Datta; M. Praveen (CoRR, 2025)