| 2012 | ||
|---|---|---|
| 11 | Sumit Nain, Moshe Y. Vardi: Synthesizing Probabilistic Composers. FoSSaCS 2012: 421-436 | |
| 2011 | ||
| 10 | Yoad Lustig, Sumit Nain, Moshe Y. Vardi: Synthesis from Probabilistic Components. CSL 2011: 412-427 | |
| 2009 | ||
| 9 | Sumit Nain, Moshe Y. Vardi: Trace Semantics is Fully Abstract. LICS 2009: 59-68 | |
| 2008 | ||
| 8 | Taolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain: On finite alphabets and infinite bases. Inf. Comput. 206(5): 492-519 (2008) | |
| 2007 | ||
| 7 | Sumit Nain, Moshe Y. Vardi: Branching vs. Linear Time: Semantical Perspective. ATVA 2007: 19-34 | |
| 2006 | ||
| 6 | Taolue Chen, Wan Fokkink, Sumit Nain: On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. FoSSaCS 2006: 1-15 | |
| 5 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain: Bisimilarity is not finitely based over BPA with interrupt. Theor. Comput. Sci. 366(1-2): 60-81 (2006) | |
| 2005 | ||
| 4 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain: Bisimilarity Is Not Finitely Based over BPA with Interrupt. CALCO 2005: 52-66 | |
| 3 | Wan Fokkink, Sumit Nain: A Finite Basis for Failure Semantics. ICALP 2005: 755-765 | |
| 2004 | ||
| 2 | Wan Fokkink, Sumit Nain: On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. FoSSaCS 2004: 182-194 | |
| 2003 | ||
| 1 | Stefan Blom, Wan Fokkink, Sumit Nain: On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. ICALP 2003: 109-118 | |
| 1 | Luca Aceto | [4] [5] |
| 2 | Stefan Blom | [1] |
| 3 | Taolue Chen | [6] [8] |
| 4 | Wan Fokkink | [1] [2] [3] [4] [5] [6] [8] |
| 5 | Anna Ingólfsdóttir | [4] [5] |
| 6 | Yoad Lustig | [10] |
| 7 | Bas Luttik (S. P. Luttik) | [8] |
| 8 | Moshe Y. Vardi | [7] [9] [10] [11] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page