Sumit Nain

15 papers A* 4B 7Journal 4
YearRankTypeTitle / Venue / Authors
2014 J jnl
Synthesis from Probabilistic Components.
Log. Methods Comput. Sci.
Sumit Nain, Yoad Lustig, Moshe Y. Vardi
2014 B conf
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.
FoSSaCS
Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi
2014 J jnl
The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies.
CoRR
Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi
2013 A* conf
Solving Partial-Information Stochastic Parity Games.
LICS
Sumit Nain, Moshe Y. Vardi
2012 B conf
Synthesizing Probabilistic Composers.
FoSSaCS
Sumit Nain, Moshe Y. Vardi
2011 B conf
Synthesis from Probabilistic Components.
CSL
Yoad Lustig, Sumit Nain, Moshe Y. Vardi
2009 A* conf
Trace Semantics is Fully Abstract.
LICS
Sumit Nain, Moshe Y. Vardi
2008 J jnl
On finite alphabets and infinite bases.
Inf. Comput.
Taolue Chen, Wan J. Fokkink, Bas Luttik, Sumit Nain
2007 B conf
Branching vs. Linear Time: Semantical Perspective.
ATVA
Sumit Nain, Moshe Y. Vardi
2006 J jnl
Bisimilarity is not finitely based over BPA with interrupt.
Theor. Comput. Sci.
Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain
2006 B conf
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.
FoSSaCS
Taolue Chen, Wan J. Fokkink, Sumit Nain
2005 A* conf
A Finite Basis for Failure Semantics.
ICALP
Wan J. Fokkink, Sumit Nain
2005 B conf
Bisimilarity Is Not Finitely Based over BPA with Interrupt.
CALCO
Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain
2004 B conf
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.
FoSSaCS
Wan J. Fokkink, Sumit Nain
2003 A* conf
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.
ICALP
Stefan Blom, Wan J. Fokkink, Sumit Nain