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

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

Probabilistic simulations for probabilistic processes R Segala, N Lynch Nordic Journal of Computing 2 (2), 250-273, 1995 | 587 | 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 | 423 | 2002 |

Probabilistic simulations for probabilistic processes R Segala, N Lynch CONCUR’94: Concurrency Theory: 5th International Conference, Uppsala, Sweden …, 1994 | 409 | 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 | 313 | 2010 |

Symbolic model checking of probabilistic processes using MTBDDs and the Kronecker representation L De Alfaro, M Kwiatkowska, G Norman, D Parker, R Segala Tools and Algorithms for the Construction and Analysis of Systems: 6th …, 2000 | 189 | 2000 |

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 | 173 | 2003 |

A compositional trace-based semantics for probabilistic automata R Segala CONCUR'95: Concurrency Theory: 6th International Conference Philadelphia, PA …, 1995 | 159 | 1995 |

Liveness in timed and untimed systems R Gawlick, R Segala, J Søgaard-Andersen, N Lynch Automata, Languages and Programming: 21st International Colloquium, ICALP 94 …, 1994 | 150 | 1994 |

Hybrid I/O automata revisited N Lynch, R Segala, F Vaandrager Hybrid Systems: Computation and Control: 4th International Workshop, HSCC …, 2001 | 134 | 2001 |

Decision algorithms for probabilistic bisimulation S Cattani, R Segala CONCUR 2421, 371-385, 2002 | 126 | 2002 |

Verifying quantitative properties of continuous probabilistic timed automata M Kwiatkowska, G Norman, R Segala, J Sproston CONCUR 2000—Concurrency Theory: 11th International Conference University …, 2000 | 122 | 2000 |

Axiomatizations for probabilistic bisimulation E Bandini, R Segala Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001 | 101 | 2001 |

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM? M Kwiatkowska, G Norman, R Segala Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001 | 94 | 2001 |

Testing probabilistic automata R Segala CONCUR'96: Concurrency Theory: 7th International Conference Pisa, Italy …, 1996 | 91 | 1996 |

Proving time bounds for randomized distributed algorithms N Lynch, I Saias, R Segala Proceedings of the thirteenth annual ACM symposium on Principles of …, 1994 | 91 | 1994 |

Liveness in timed and untimed systems R Segala, R Gawlick, J Søgaard-Andersen, N Lynch Information and Computation 141 (2), 119-171, 1998 | 83 | 1998 |

The theory of timed I D Kaynar, N Lynch, R Segala, F Vaandrager O automata. Technical Report MIT/LCS/TR-917a, MIT Laboratory for Computer …, 2004 | 82 | 2004 |

Compositionality for probabilistic automata N Lynch, R Segala, F Vaandrager CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003 | 79 | 2003 |