S. Purushothaman Iyer

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
FM 2005: Formal Methods Lecture Notes in Computer Science	2006-01-10	Paper
Probabilistic temporal logics via the modal mu-calculus Theoretical Computer Science	2005-09-22	Paper
Simulating perfect channels with probabilistic lossy channels Information and Computation	2005-05-12	Paper
SAT-solving the coverability problem for Petri nets Formal Methods in System Design	2004-09-09	Paper
scientific article; zbMATH DE number 1973988 (Why is no real title available?)	2003-09-03	Paper
Well-abstracted transition systems: Application to FIFO automata. Information and Computation	2003-08-19	Paper
scientific article; zbMATH DE number 1670797 (Why is no real title available?)	2001-11-11	Paper
An operational semantics of sharing in lazy evaluation Science of Computer Programming	1997-03-03	Paper
Unreliable channels are easier to verify than perfect channels Information and Computation	1996-03-27	Paper
A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES International Journal of Foundations of Computer Science	1995-10-29	Paper

Research outcomes over time

This page was built for person: S. Purushothaman Iyer