M. Praveen

According to our database, M. Praveen authored at least 29 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Realizability problem for constraint LTL.

Ashwin Bhaskar, M. Praveen

Inf. Comput., January, 2024

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol.

M. Praveen, Raghavendra Ramesh, Isaac Doidge

CoRR, 2024

On the Piecewise Complexity of Words and Periodic Words.

M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

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

Proceedings of the 14th International Conference on Computing Communication and Networking Technologies, 2023

Constraint LTL with Remote Access.

Ashwin Bhaskar, M. Praveen

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

Window Expressions for Stream Data Processing.

M. Praveen, S. Hitarth

CoRR, 2022

Checking Regular Invariance Under Tightly-Controlled String Modifications.

C. Aiswarya, Sahil Mhaskar, M. Praveen

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2020

Verification of Flat FIFO Systems.

Alain Finkel, M. Praveen

Log. Methods Comput. Sci., 2020

Playing with Repetitions in Data Words Using Energy Games.

Diego Figueira, Anirban Majumdar, M. Praveen

Log. Methods Comput. Sci., 2020

What You Must Remember When Transforming Datawords.

M. Praveen

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

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

Query Preserving Watermarking Schemes for Locally Treelike Databases.

Agnishom Chattopadhyay, M. Praveen

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Playing with Repetitions in Data Words Using Energy Games.

Diego Figueira, M. Praveen

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2016

Reasoning about Data Repetitions with Counter Systems.

Stéphane Demri, Diego Figueira, M. Praveen

Log. Methods Comput. Sci., 2016

Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity.

M. Praveen, B. Srivathsan

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

ω-Petri Nets: Algorithms and Complexity.

Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin

Fundam. Informaticae, 2015

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?

M. Praveen, B. Srivathsan

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014

Hyper-Ackermannian bounds for pushdown vector addition systems.

Jérôme Leroux, M. Praveen, Grégoire Sutre

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Does Treewidth Help in Modal Satisfiability?

M. Praveen

ACM Trans. Comput. Log., 2013

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier.

M. Praveen

Algorithmica, 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, E. A. Neethu, Bira Chandra Singh, Sanasam Ranbir Singh, Hema A. Murthy

Proceedings of the 2013 International Conference Oriental COCOSDA held jointly with 2013 Conference on Asian Spoken Language Research and Evaluation (O-COCOSDA/CASLRE), 2013

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness.

Jérôme Leroux, M. Praveen, Grégoire Sutre

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

ω-Petri Nets.

Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

2012

Extending the Rackoff technique to Affine nets.

Rémi Bonnet, Alain Finkel, M. Praveen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

A Regularity Measure for Context Free Grammars

M. Praveen

CoRR, 2011

Parameterized Complexity Results for 1-safe Petri Nets.

M. Praveen, Kamal Lodaya

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

Does Treewidth Help in Modal Satisfiability? - (Extended Abstract).

M. Praveen

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE.

M. Praveen, Kamal Lodaya

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

Analyzing Reachability for Some Petri Nets With Fast Growing Markings.

M. Praveen, Kamal Lodaya

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008