×

zbMATH — the first resource for mathematics

Praveen, M.

Compute Distance To:
Author ID: praveen.m Recent zbMATH articles by "Praveen, M."
Published as: Praveen, M.
Documents Indexed: 18 Publications since 2008

Publications by Year

Citations contained in zbMATH

12 Publications have been cited 28 times in 23 Documents Cited by Year
Reasoning about data repetitions with counter systems. Zbl 1366.68202
Demri, Stéphane; Figueira, Diego; Praveen, M.
5
2013
Hyper-Ackermannian bounds for pushdown vector addition systems. Zbl 1392.68307
Leroux, Jérôme; Praveen, M.; Sutre, Grégoire
4
2014
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. Zbl 1248.68356
Praveen, M.; Lodaya, Kamal
4
2009
\(\omega \)-Petri nets. Zbl 1381.68202
Geeraerts, Gilles; Heussner, Alexander; Praveen, M.; Raskin, Jean-François
3
2013
Reasoning about data repetitions with counter systems. Zbl 1448.68339
Demri, Stéphane; Figueira, Diego; Praveen, M.
2
2016
\(\omega\)-Petri nets: algorithms and complexity. Zbl 1335.68172
Geeraerts, Gilles; Heußner, Alexander; Praveen, M.; Raskin, Jean-François
2
2015
Parameterized complexity results for 1-safe Petri nets. Zbl 1238.68103
Praveen, M.; Lodaya, Kamal
2
2011
Small vertex cover makes Petri net coverability and boundedness easier. Zbl 1253.68250
Praveen, M.
2
2010
Does treewidth help in modal satisfiability? Zbl 1354.68133
Praveen, M.
1
2013
A relational trace logic for vector addition systems with application to context-freeness. Zbl 1390.68478
Leroux, Jérôme; Praveen, M.; Sutre, Grégoire
1
2013
Extending the Rackoff technique to affine nets. Zbl 1354.68190
Bonnet, Rémi; Finkel, Alain; Praveen, M.
1
2012
Analyzing reachability for some Petri nets with fast growing markings. Zbl 1337.68190
Praveen, M.; Lodaya, Kamal
1
2008
Reasoning about data repetitions with counter systems. Zbl 1448.68339
Demri, Stéphane; Figueira, Diego; Praveen, M.
2
2016
\(\omega\)-Petri nets: algorithms and complexity. Zbl 1335.68172
Geeraerts, Gilles; Heußner, Alexander; Praveen, M.; Raskin, Jean-François
2
2015
Hyper-Ackermannian bounds for pushdown vector addition systems. Zbl 1392.68307
Leroux, Jérôme; Praveen, M.; Sutre, Grégoire
4
2014
Reasoning about data repetitions with counter systems. Zbl 1366.68202
Demri, Stéphane; Figueira, Diego; Praveen, M.
5
2013
\(\omega \)-Petri nets. Zbl 1381.68202
Geeraerts, Gilles; Heussner, Alexander; Praveen, M.; Raskin, Jean-François
3
2013
Does treewidth help in modal satisfiability? Zbl 1354.68133
Praveen, M.
1
2013
A relational trace logic for vector addition systems with application to context-freeness. Zbl 1390.68478
Leroux, Jérôme; Praveen, M.; Sutre, Grégoire
1
2013
Extending the Rackoff technique to affine nets. Zbl 1354.68190
Bonnet, Rémi; Finkel, Alain; Praveen, M.
1
2012
Parameterized complexity results for 1-safe Petri nets. Zbl 1238.68103
Praveen, M.; Lodaya, Kamal
2
2011
Small vertex cover makes Petri net coverability and boundedness easier. Zbl 1253.68250
Praveen, M.
2
2010
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. Zbl 1248.68356
Praveen, M.; Lodaya, Kamal
4
2009
Analyzing reachability for some Petri nets with fast growing markings. Zbl 1337.68190
Praveen, M.; Lodaya, Kamal
1
2008

Citations by Year