#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2004

2018

- This year (1)
- Last 5 years (12)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
- Petri Nets
- 2013

Definitions – Source Transition: a transition without any input place » is unconditionally enabled – Sink Transition: a transition without any output place » consumes but does not create any tokens… (More)

- M. Praveen
- ACM Trans. Comput. Log.
- 2013

Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular,… (More)

- Jérôme Leroux, M. Praveen, Grégoire Sutre
- CSL-LICS
- 2014

This paper studies the boundedness and termination problems for vector addition systems equipped with one stack. We introduce an algorithm, inspired by the Karp & Miller algorithm, that solves both… (More)

- Stéphane Demri, Diego Figueira, M. Praveen
- 2013 28th Annual ACM/IEEE Symposium on Logic in…
- 2013

We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions… (More)

- Rémi Bonnet, Alain Finkel, M. Praveen
- FSTTCS
- 2012

We study the possibility of extending the Rackoff technique to Affine nets, which are Petri nets extended with affine functions. The Rackoff technique has been used for establishing Expspace upper… (More)

- Jérôme Leroux, M. Praveen, Grégoire Sutre
- CONCUR
- 2013

We introduce a logic for specifying trace properties of vector addition systems (VAS). This logic can express linear relations among pumping segments occurring in a trace. Given a VAS and a formula… (More)

- M. Praveen, Kamal Lodaya
- CONCUR
- 2011

We associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph. With treewidth as the parameter, we give W[1]-hardness… (More)

- M. Praveen
- IPEC
- 2010

- M. Praveen
- MFCS
- 2010

Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular,… (More)

- Pranaw Kumar, Gandhi Annamalai, +13 authors Hema A. Murthy
- 2013 International Conference Oriental COCOSDA…
- 2013

India is home to about 1600 languages. Less than 5% of this population is English literate. A consortium effort on developing a common framework to build text-to-speech synthesis (TTS) in various… (More)