Modeling and verification of randomized distributed real-time systems R Segala Massachusetts Institute of Technology, 1996 | 804 | 1996 |

Hybrid i/o automata N Lynch, R Segala, F Vaandrager Information and computation 185 (1), 105-157, 2003 | 749* | 2003 |

Probabilistic simulations for probabilistic processes R Segala, N Lynch Nordic Journal of Computing 2 (2), 250-273, 1995 | 524 | 1995 |

Automatic verification of real-time systems with discrete probability distributions M Kwiatkowska, G Norman, R Segala, J Sproston Theoretical Computer Science 282 (1), 101-150, 2002 | 349 | 2002 |

Probabilistic simulations for probabilistic processes R Segala, N Lynch International Conference on Concurrency Theory, 481-496, 1994 | 339 | 1994 |

The theory of timed I/O automata DK Kaynar, N Lynch, R Segala, F Vaandrager Synthesis Lectures on Distributed Computing Theory 1 (1), 1-137, 2010 | 262 | 2010 |

Symbolic model checking of probabilistic processes using MTBDDs and the Kronecker representation L De Alfaro, M Kwiatkowska, G Norman, D Parker, R Segala International Conference on Tools and Algorithms for the Construction and …, 2000 | 155 | 2000 |

Liveness in timed and untimed systems R Gawlick, R Segala, J Søgaard-Andersen, N Lynch International Colloquium on Automata, Languages, and Programming, 166-177, 1994 | 148 | 1994 |

Timed I/O automata: A mathematical framework for modeling and analyzing real-time systems DK Kaynar, N Lynch, R Segala, F Vaandrager RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003, 166-177, 2003 | 135 | 2003 |

Hybrid I/O automata revisited N Lynch, R Segala, F Vaandrager International Workshop on Hybrid Systems: Computation and Control, 403-417, 2001 | 133 | 2001 |

A compositional trace-based semantics for probabilistic automata R Segala International Conference on Concurrency Theory, 234-248, 1995 | 130 | 1995 |

The theory of timed I DK Kaynar, N Lynch, R Segala, F Vaandrager O Automata (Synthesis Lectures in Computer Science), Morgan & Claypool …, 2006 | 113 | 2006 |

Decision algorithms for probabilistic bisimulation S Cattani, R Segala International Conference on Concurrency Theory, 371-386, 2002 | 111 | 2002 |

Verifying quantitative properties of continuous probabilistic timed automata M Kwiatkowska, G Norman, R Segala, J Sproston International Conference on Concurrency Theory, 123-137, 2000 | 108 | 2000 |

Proving time bounds for randomized distributed algorithms N Lynch, I Saias, R Segala arXiv preprint math/9409221, 1994 | 83 | 1994 |

Axiomatizations for probabilistic bisimulation E Bandini, R Segala International Colloquium on Automata, Languages, and Programming, 370-381, 2001 | 81 | 2001 |

Testing probabilistic automata R Segala International Conference on Concurrency Theory, 299-314, 1996 | 81 | 1996 |

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM? M Kwiatkowska, G Norman, R Segala International Conference on Computer Aided Verification, 194-206, 2001 | 73 | 2001 |

Logical characterizations of bisimulations for discrete probabilistic systems A Parma, R Segala International Conference on Foundations of Software Science and …, 2007 | 70 | 2007 |

Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study A Pogosyants, R Segala, N Lynch Distributed Computing 13 (3), 155-186, 2000 | 66 | 2000 |