M. Praveen

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 28

Top Topics

Video Watermarking

Invariant Properties

Top Venues

Log. Methods Comput. Sci.

Fundam. Informaticae

Publications

M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard
On the Piecewise Complexity of Words and Periodic Words. SOFSEM (2024)
Ashwin Bhaskar, M. Praveen
Realizability problem for constraint LTL. Inf. Comput. 296 (2024)
M. Praveen, Raghavendra Ramesh, Isaac Doidge
Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol. CoRR (2024)
M. Praveen, Raghavendra Ramesh, Isaac Doidge
Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol. FMBC@CAV (2024)
Ashwin Bhaskar, M. Praveen
Constraint LTL with Remote Access. FSTTCS (2023)
A. E. Narayanan, M. Ishwarya, S. Kaviarasan, M. Praveen, N. Sagana
Detection and Classification of 'Myopia Epidemic' Using Image Processing and Machine Learning to Prevent Fatal Road Accidents. ICCCNT (2023)
M. Praveen, Philippe Schnoebelen, Isa Vialard, Julien Veron
On the piecewise complexity of words and periodic words. CoRR (2023)
C. Aiswarya, Sahil Mhaskar, M. Praveen
Checking Regular Invariance Under Tightly-Controlled String Modifications. DLT (2022)
M. Praveen, S. Hitarth
Window Expressions for Stream Data Processing. CoRR (2022)
Ashwin Bhaskar, M. Praveen
Realizability Problem for Constraint LTL. TIME (2022)
Ashwin Bhaskar, M. Praveen
Realizability Problem for Constraint LTL. CoRR (2022)
Diego Figueira, Anirban Majumdar, M. Praveen
Playing with Repetitions in Data Words Using Energy Games. Log. Methods Comput. Sci. 16 (3) (2020)
Alain Finkel, M. Praveen
Verification of Flat FIFO Systems. Log. Methods Comput. Sci. 16 (4) (2020)
M. Praveen
What You Must Remember When Transforming Datawords. FSTTCS (2020)
M. Praveen
What You Must Remember When Transforming Datawords. CoRR (2020)
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Log. Methods Comput. Sci. 15 (4) (2019)
Agnishom Chattopadhyay, M. Praveen
Query Preserving Watermarking Schemes for Locally Treelike Databases. FSTTCS (2019)
Agnishom Chattopadhyay, M. Praveen
Query Preserving Watermarking Schemes for Locally Treelike Databases. CoRR (2019)
Alain Finkel, M. Praveen
Verification of Flat FIFO Systems. CONCUR (2019)
Alain Finkel, M. Praveen
Verification of Flat FIFO Systems. CoRR (2019)
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR (2019)
Diego Figueira, M. Praveen
Playing with Repetitions in Data Words Using Energy Games. LICS (2018)
Diego Figueira, M. Praveen
Playing with Repetitions in Data Words Using Energy Games. CoRR (2018)
M. Praveen, B. Srivathsan
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. ICALP (2016)
M. Praveen, B. Srivathsan
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity. CoRR (2016)
Stéphane Demri, Diego Figueira, M. Praveen
Reasoning about Data Repetitions with Counter Systems. Log. Methods Comput. Sci. 12 (3) (2016)
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137 (1) (2015)
M. Praveen, B. Srivathsan
Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? PODS (2015)
M. Praveen, B. Srivathsan
Defining relations on graphs: how hard is it in the presence of node partitions? CoRR (2014)
Jérôme Leroux, M. Praveen, Grégoire Sutre
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS (2014)
Jérôme Leroux, M. Praveen, Grégoire Sutre
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR (2013)
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
ω-Petri Nets. Petri Nets (2013)
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
Seamless integration of common framework Indian language TTSes in various applications. O-COCOSDA/CASLRE (2013)
M. Praveen
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. Algorithmica 65 (4) (2013)
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
ω-Petri nets CoRR (2013)
Stéphane Demri, Diego Figueira, M. Praveen
Reasoning about Data Repetitions with Counter Systems. LICS (2013)
M. Praveen
Does Treewidth Help in Modal Satisfiability? ACM Trans. Comput. Log. 14 (3) (2013)
Rémi Bonnet, Alain Finkel, M. Praveen
Extending the Rackoff technique to Affine nets. FSTTCS (2012)
M. Praveen, Kamal Lodaya
Parameterized complexity results for 1-safe Petri nets CoRR (2011)
M. Praveen
A Regularity Measure for Context Free Grammars CoRR (2011)
M. Praveen, Kamal Lodaya
Parameterized Complexity Results for 1-safe Petri Nets. CONCUR (2011)
M. Praveen
Does Treewidth Help in Modal Satisfiability? CoRR (2010)
M. Praveen
Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). MFCS (2010)
M. Praveen
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier CoRR (2010)
M. Praveen
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier. IPEC (2010)
M. Praveen, Kamal Lodaya
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. FSTTCS (2009)
M. Praveen, Kamal Lodaya
Analyzing Reachability for Some Petri Nets With Fast Growing Markings. Electron. Notes Theor. Comput. Sci. 223 (2008)