| Reaching approximate agreement in the presence of faults D Dolev, NA Lynch, SS Pinter, EW Stark, WE Weihl Journal of the ACM (JACM) 33 (3), 499-516, 1986 | 691 | 1986 |
| Composition and behaviors of probabilistic I/O automata SH Wu, SA Smolka, EW Stark Theoretical Computer Science 176 (1-2), 1-38, 1997 | 173 | 1997 |
| A proof technique for rely/guarantee properties EW Stark Foundations of Software Technology and Theoretical Computer Science: Fifth …, 1985 | 172 | 1985 |
| Concurrent transition systems EW Stark Theoretical Computer Science 64 (3), 221-269, 1989 | 165 | 1989 |
| A proof of the Kahn principle for input/output automata NA Lynch, EW Stark Information and Computation 82 (1), 81-92, 1989 | 157 | 1989 |
| Computations, residuals, and the power of indeterminacy P Panangaden, EW Stark Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988 | 98 | 1988 |
| Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools: A Comparative Study of Verification Tools Y Dong, X Du, YS Ramakrishna, CR Ramakrishnan, IV Ramakrishnan, ... International Conference on Tools and Algorithms for the Construction and …, 1999 | 68 | 1999 |
| Composition and behaviors of probabilistic I/O automata SH Wu, SA Smolka, EW Stark CONCUR’94: Concurrency Theory: 5th International Conference, Uppsala, Sweden …, 1994 | 63 | 1994 |
| Connections between a concrete and an abstract model of concurrent systems EW Stark International Conference on Mathematical Foundations of Programming …, 1989 | 63 | 1989 |
| A complete axiom system for finite-state probabilistic processes. EW Stark, SA Smolka Proof, Language, and Interaction, 571-596, 2000 | 62 | 2000 |
| Foundations of a theory of specification for Distributed Systems EW Stark | 59 | 1984 |
| Debugging type errors (full version) KL Bernstein, EW Stark Unpublished Technical Report, Computer Science Dept. State University of New …, 1995 | 57 | 1995 |
| Proving entailment between conceptual state specifications EW Stark Theoretical Computer Science 56 (1), 135-154, 1988 | 54 | 1988 |
| Compositional relational semantics for indeterminate dataflow networks EW Stark Category Theory and Computer Science: Manchester, UK, September 5–8, 1989 …, 2005 | 50 | 2005 |
| Semaphore primitives and starvation-free mutual exclusion EW Stark Journal of the ACM (JACM) 29 (4), 1049-1072, 1982 | 42 | 1982 |
| Concurrent transition system semantics of process networks EW Stark Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of …, 1987 | 41 | 1987 |
| Stability and sequentiality in dataflow networks P Panangaden, V Shanbhogue, EW Stark Automata, Languages and Programming: 17th International Colloquium Warwick …, 1990 | 40 | 1990 |
| Compositional analysis of expected delays in networks of probabilistic I/O automata EW Stark, SA Smolka Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998 | 37 | 1998 |
| A process-algebraic language for probabilistic I/O automata EW Stark, R Cleaveland, SA Smolka International Conference on Concurrency Theory, 193-207, 2003 | 28 | 2003 |
| A simple generalization of Kahn’s principle to indeterminate dataflow networks MZ Kwiatkowska, MW Shields, RM Thomas, EW Stark Semantics for Concurrency: Proceedings of the International BCS-FACS …, 1990 | 27 | 1990 |
Scott A. SmolkaProfessor of Computer Science, Stony Brook UniversityOverená e-mailová adresa na: cs.sunysb.edu
