CCS expressions, finite state processes, and three problems of equivalence PC Kanellakis, SA Smolka Information and computation 86 (1), 43-68, 1990 | 831 | 1990 |

Handbook of process algebra JA Bergstra, A Ponse, SA Smolka Elsevier Science, 2001 | 793 | 2001 |

Reactive, generative, and stratified models of probabilistic processes R Van Glabbeek, SA Smolka, B Steffen, CMN Tofts [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science …, 1990 | 636 | 1990 |

Algebraic reasoning for probabilistic concurrent systems A Giacalone, CC Jou, SA Smolka Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, 1990 | 298 | 1990 |

Efficient model checking using tabled resolution Y Ramakrishna, C Ramakrishnan, I Ramakrishnan, S Smolka, T Swift, ... Computer Aided Verification, 143-154, 1997 | 279 | 1997 |

Interactive computation: The new paradigm D Goldin, SA Smolka, P Wegner Springer, 2006 | 255* | 2006 |

Equivalences, congruences, and complete axiomatizations for probabilistic processes CC Jou, S Smolka CONCUR'90 Theories of Concurrency: Unification and Extension, 367-383, 1990 | 241 | 1990 |

Monte carlo model checking R Grosu, S Smolka Tools and Algorithms for the Construction and Analysis of Systems, 271-286, 2005 | 208 | 2005 |

Handbook of Process Algebra SA Smolka, JA Bergstra, A Ponse Elsevier, 2001 | 182 | 2001 |

Composition and behaviors of probabilistic I/O automata SH Wu, SA Smolka, EW Stark Theoretical Computer Science 176 (1-2), 1-38, 1997 | 160 | 1997 |

Axiomatizing probabilistic processes: ACP with generative probabilities JA Bergstra, JCM Baeten, SA Smolka Information and Computation 121 (2), 234-254, 1995 | 143* | 1995 |

Turing machines, transition systems, and interaction DQ Goldin, SA Smolka, PC Attie, EL Sonderegger Information and computation 194 (2), 101-128, 2004 | 133 | 2004 |

A process calculus for mobile ad hoc networks A Singh, CR Ramakrishnan, SA Smolka Science of Computer Programming 75 (6), 440-469, 2010 | 115 | 2010 |

A compositional semantics for Statecharts using labeled transition systems A Uselton, S Smolka CONCUR'94: Concurrency Theory, 2-17, 1994 | 113 | 1994 |

Model repair for probabilistic systems E Bartocci, R Grosu, P Katsaros, C Ramakrishnan, S Smolka Tools and Algorithms for the Construction and Analysis of Systems, 326-340, 2011 | 111 | 2011 |

On randomization in sequential and distributed algorithms R Gupta, SA Smolka, S Bhaskar ACM Computing Surveys (CSUR) 26 (1), 7-86, 1994 | 110 | 1994 |

Runtime verification with state estimation S Stoller, E Bartocci, J Seyster, R Grosu, K Havelund, S Smolka, E Zadok Runtime Verification, 193-207, 2012 | 106 | 2012 |

GFS: evolution on fast-forward K McKusick, S Quinlan Communications of the ACM 53 (3), 42-49, 2010 | 105* | 2010 |

Incremental model checking in the modal mu-calculus O Sokolsky, S Smolka Computer Aided Verification, 351-363, 1994 | 104 | 1994 |

Simple linear-time algorithms for minimal fixed points X Liu, S Smolka Automata, Languages and Programming, 53-66, 1998 | 103 | 1998 |