M. Praveen

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