default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Praveen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Ashwin Bhaskar
, M. Praveen:
Realizability problem for constraint LTL. Inf. Comput. 296: 105126 (2024)- [c23]M. Praveen, Raghavendra Ramesh, Isaac Doidge:
Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol. FMBC@CAV 2024: 3:1-3:16 - [c22]M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard:
On the Piecewise Complexity of Words and Periodic Words. SOFSEM 2024: 456-470 - [i16]M. Praveen, Raghavendra Ramesh, Isaac Doidge:
Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol. CoRR abs/2403.16637 (2024) - 2023
- [c21]Ashwin Bhaskar, M. Praveen:
Constraint LTL with Remote Access. FSTTCS 2023: 41:1-41:21 - [c20]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: 1-6 - [i15]M. Praveen, Philippe Schnoebelen, Isa Vialard, Julien Veron:
On the piecewise complexity of words and periodic words. CoRR abs/2311.15431 (2023) - 2022
- [c19]C. Aiswarya, Sahil Mhaskar, M. Praveen:
Checking Regular Invariance Under Tightly-Controlled String Modifications. DLT 2022: 57-68 - [c18]Ashwin Bhaskar, M. Praveen:
Realizability Problem for Constraint LTL. TIME 2022: 8:1-8:19 - [i14]Ashwin Bhaskar, M. Praveen:
Realizability Problem for Constraint LTL. CoRR abs/2207.06708 (2022) - [i13]M. Praveen, S. Hitarth:
Window Expressions for Stream Data Processing. CoRR abs/2209.04244 (2022) - 2020
- [j7]Diego Figueira, Anirban Majumdar, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. Log. Methods Comput. Sci. 16(3) (2020) - [j6]Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. Log. Methods Comput. Sci. 16(4) (2020) - [c17]M. Praveen:
What You Must Remember When Transforming Datawords. FSTTCS 2020: 55:1-55:14 - [i12]M. Praveen:
What You Must Remember When Transforming Datawords. CoRR abs/2005.02596 (2020)
2010 – 2019
- 2019
- [j5]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) - [c16]Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. CONCUR 2019: 12:1-12:17 - [c15]Agnishom Chattopadhyay, M. Praveen:
Query Preserving Watermarking Schemes for Locally Treelike Databases. FSTTCS 2019: 36:1-36:14 - [i11]Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR abs/1904.04090 (2019) - [i10]Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. CoRR abs/1908.07282 (2019) - [i9]Agnishom Chattopadhyay, M. Praveen:
Query Preserving Watermarking Schemes for Locally Treelike Databases. CoRR abs/1909.11369 (2019) - 2018
- [c14]Diego Figueira, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. LICS 2018: 404-413 - [i8]Diego Figueira, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. CoRR abs/1802.07435 (2018) - 2016
- [j4]Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. Log. Methods Comput. Sci. 12(3) (2016) - [c13]M. Praveen, B. Srivathsan:
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. ICALP 2016: 117:1-117:14 - [i7]M. Praveen, B. Srivathsan:
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity. CoRR abs/1603.00658 (2016) - 2015
- [j3]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137(1): 29-60 (2015) - [c12]M. Praveen, B. Srivathsan:
Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? PODS 2015: 159-172 - 2014
- [c11]Jérôme Leroux, M. Praveen, Grégoire Sutre:
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS 2014: 63:1-63:10 - [i6]M. Praveen, B. Srivathsan:
Defining relations on graphs: how hard is it in the presence of node partitions? CoRR abs/1412.4463 (2014) - 2013
- [j2]M. Praveen:
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. Algorithmica 65(4): 713-753 (2013) - [j1]M. Praveen:
Does Treewidth Help in Modal Satisfiability? ACM Trans. Comput. Log. 14(3): 18:1-18:32 (2013) - [c10]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets. Petri Nets 2013: 49-69 - [c9]Jérôme Leroux, M. Praveen, Grégoire Sutre:
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013: 137-151 - [c8]Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. LICS 2013: 33-42 - [c7]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: 1-6 - [i5]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri nets. CoRR abs/1301.6572 (2013) - 2012
- [c6]Rémi Bonnet, Alain Finkel, M. Praveen:
Extending the Rackoff technique to Affine nets. FSTTCS 2012: 301-312 - 2011
- [c5]M. Praveen, Kamal Lodaya:
Parameterized Complexity Results for 1-safe Petri Nets. CONCUR 2011: 358-372 - [i4]M. Praveen, Kamal Lodaya:
Parameterized complexity results for 1-safe Petri nets. CoRR abs/1106.2122 (2011) - [i3]M. Praveen:
A Regularity Measure for Context Free Grammars. CoRR abs/1109.5615 (2011) - 2010
- [c4]M. Praveen:
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier. IPEC 2010: 216-227 - [c3]M. Praveen:
Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). MFCS 2010: 580-591 - [i2]M. Praveen:
Does Treewidth Help in Modal Satisfiability? CoRR abs/1006.2461 (2010) - [i1]M. Praveen:
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. CoRR abs/1009.2577 (2010)
2000 – 2009
- 2009
- [c2]M. Praveen, Kamal Lodaya:
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. FSTTCS 2009: 347-358 - 2008
- [c1]M. Praveen, Kamal Lodaya:
Analyzing Reachability for Some Petri Nets With Fast Growing Markings. RP 2008: 215-237
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
