On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. - Stefan Blom; Wan J. Fokkink; Sumit Nain (ICALP, 2003)

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. - Wan J. Fokkink; Sumit Nain (FoSSaCS, 2004)

A Finite Basis for Failure Semantics. - Wan J. Fokkink; Sumit Nain (ICALP, 2005)

On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. - Taolue Chen 001; Wan J. Fokkink; Sumit Nain (FoSSaCS, 2006)

Bisimilarity is not finitely based over BPA with interrupt. - Luca Aceto; Wan J. Fokkink; Anna Ingólfsdóttir; Sumit Nain (Theor. Comput. Sci., 2006)

Branching vs. Linear Time: Semantical Perspective. - Sumit Nain; Moshe Y. Vardi (ATVA, 2007)

On finite alphabets and infinite bases. - Taolue Chen 001; Wan J. Fokkink; Bas Luttik; Sumit Nain (Inf. Comput., 2008)

Trace Semantics is Fully Abstract. - Sumit Nain; Moshe Y. Vardi (LICS, 2009)

Synthesizing Probabilistic Composers. - Sumit Nain; Moshe Y. Vardi (FoSSaCS, 2012)

Solving Partial-Information Stochastic Parity Games. - Sumit Nain; Moshe Y. Vardi (LICS, 2013)

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. - Krishnendu Chatterjee; Laurent Doyen 001; Sumit Nain; Moshe Y. Vardi (FoSSaCS, 2014)

Synthesis from Probabilistic Components. - Sumit Nain; Yoad Lustig; Moshe Y. Vardi (Log. Methods Comput. Sci., 2014)