☰

Prasannaa Thati, Ph.D. - Publications

Affiliations: 
2003 University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

7/16 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2004 Thati P, Sen K, Martí-Oliet N. An executable specification of asynchronous Pi-calculus semantics and may testing in Maude 2.0 Electronic Notes in Theoretical Computer Science. 71: 242-262. DOI: 10.1016/S1571-0661(05)82539-3  0.546
2004 Agha G, Thati P. An algebraic theory of actors and its application to a simple object-based language Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2635: 26-57.  0.491
2004 Thati P, Talcott C, Agha G. Techniques for executing and reasoning about specification diagrams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3116: 521-536.  0.533
2002 Thati P, Ziaei R, Agha G. A theory of may testing for actors Ifip Advances in Information and Communication Technology. 81: 147-162.  0.493
2002 Thati P, Ziaei R, Agha G. A theory of may testing for asynchronous calculi with locality and no name matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2422: 223-239.  0.564
2001 Thati P, Chang PH, Agha G. Crawlets: Agents for high performance web search engines Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2240: 119-134. DOI: 10.1007/3-540-45647-3_9  0.469
1999 Jamali N, Thati P, Aghu GA. An actor-based architecture for customizing and controlling agent ensembles Ieee Intelligent Systems and Their Applications. 14: 38-44. DOI: 10.1109/5254.757630  0.531
Low-probability matches (unlikely to be authored by this person)
2005 Escobar S, Meseguer J, Thati P. Natural rewriting for general term rewriting systems Lecture Notes in Computer Science. 3573: 101-116.  0.252
2004 Naldurg P, Sen K, Thati P. A temporal logic based framework for intrusion detection Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3235: 359-375.  0.237
2005 Escobar S, Meseguer J, Thati P. Natural narrowing for general term rewriting systems Lecture Notes in Computer Science. 3467: 279-293.  0.237
2005 Chaki S, Clarke E, Sinha N, Thati P. Automated assume-guarantee reasoning for simulation conformance Lecture Notes in Computer Science. 3576: 534-547.  0.227
2007 Meseguer J, Thati P. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols Higher-Order and Symbolic Computation. 20: 123-160. DOI: 10.1016/J.Entcs.2004.06.024  0.217
2000 Mohindra A, Purakayastha A, Thati P. Exploiting non-determinism for reliability of mobile agent systems Proceedings of the 2002 International Conference On Dependable Systems and Networks. 144-153. DOI: 10.1109/ICDSN.2000.857528  0.205
2007 Escobar S, Meseguer J, Thati P. Narrowing and Rewriting Logic: from Foundations to Applications Electronic Notes in Theoretical Computer Science. 177: 5-33. DOI: 10.1016/J.Entcs.2007.01.004  0.195
2005 Thati P, Rou G. Monitoring Algorithms for Metric Temporal Logic Specifications Electronic Notes in Theoretical Computer Science. 113: 145-162. DOI: 10.1016/J.Entcs.2004.01.029  0.191
2006 Thati P, Meseguer J. Complete symbolic reachability analysis using back-and-forth narrowing Theoretical Computer Science. 366: 163-179. DOI: 10.1016/j.tcs.2006.07.008  0.143
Hide low-probability matches.