Suivre
M. Praveen
M. Praveen
Associate professor, Chennai Mathemaitical Institute
Adresse e-mail validée de cmi.ac.in - Page d'accueil
Titre
Citée par
Citée par
Année
Reasoning about data repetitions with counter systems
S Demri, D Figueira, M Praveen
Logical Methods in Computer Science 12, 2016
412016
Hyper-Ackermannian bounds for pushdown vector addition systems
J Leroux, M Praveen, G Sutre
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
352014
Playing with repetitions in data words using energy games
D Figueira, M Praveen
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
132018
Verification of flat FIFO systems
A Finkel, M Praveen
Logical Methods in Computer Science 16, 2020
122020
Analyzing reachability for some Petri nets with fast growing markings
M Praveen, K Lodaya
Electronic Notes in Theoretical Computer Science 223, 215-237, 2008
122008
Does treewidth help in modal satisfiability?
M Praveen
ACM Transactions on Computational Logic (TOCL) 14 (3), 1-32, 2013
112013
ω-Petri Nets
G Geeraerts, A Heußner, M Praveen, JF Raskin
Application and Theory of Petri Nets and Concurrency: 34th International …, 2013
102013
A relational trace logic for vector addition systems with application to context-freeness
J Leroux, M Praveen, G Sutre
International Conference on Concurrency Theory, 137-151, 2013
92013
Extending the Rackoff technique to affine nets
R Bonnet, A Finkel, M Praveen
IARCS Annual Conference on Foundations of Software Technology and …, 2012
92012
ω-Petri Nets: Algorithms and Complexity.
G Geeraerts, A Heußner, M Praveen, JF Raskin
Fundam. Informaticae 137 (1), 29-60, 2015
72015
Parameterized complexity results for 1-safe Petri nets
M Praveen, K Lodaya
International Conference on Concurrency Theory, 358-372, 2011
72011
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
M Praveen, K Lodaya
IARCS Annual Conference on Foundations of Software Technology and …, 2009
72009
Small vertex cover makes petri net coverability and boundedness easier
M Praveen
International Symposium on Parameterized and Exact Computation, 216-227, 2010
52010
Complexity of the reachability problem in subclasses of Petri nets
M Praveen
Master's thesis, Homi Bhabha National Institute, 2008
52008
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
J Leroux, M Praveen, P Schnoebelen, G Sutre
Logical Methods in Computer Science 15 (4), 2019
42019
Realizability problem for constraint LTL
A Bhaskar, M Praveen
Information and Computation 296, 105126, 2024
32024
Does treewidth help in modal satisfiability?
M Praveen
Mathematical Foundations of Computer Science 2010: 35th International …, 2010
32010
Logic, Courcelle’s theorem and application
M Praveen
IMPECS School on Parameterized and Exact Computation (December 2010), 2010
22010
What You Must Remember When Transforming Datawords
M Praveen
40th IARCS Annual Conference on Foundations of Software Technology and …, 2020
12020
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity
M Praveen, B Srivathsan
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
12016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20