Search the dblp DataBase
Pritha Mahata: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso
Regular Tree Model Checking. [Citation Graph (0, 0)][DBLP]
CAV, 2002, pp:555-568 [Conf] - Pritha Mahata, Wagner Costa, Carlos Cotta, Pablo Moscato
Hierarchical Clustering, Languages and Cancer. [Citation Graph (0, 0)][DBLP]
EvoWorkshops, 2006, pp:67-78 [Conf] - Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén
Forward Reachability Analysis of Timed Petri Nets. [Citation Graph (0, 0)][DBLP]
FORMATS/FTRTFT, 2004, pp:343-362 [Conf] - Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:58-70 [Conf] - Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata
Multi-Clock Timed Networks. [Citation Graph (0, 0)][DBLP]
LICS, 2004, pp:345-354 [Conf] - Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata
Closed, Open, and Robust Timed Networks. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:117-151 [Journal] - Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Dense-Timed Petri Nets: Checking Zenoness, Token liveness<br> and<br><br> Boundedness [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002