Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract). - Roberto Segala (CONCUR, 1993)

Proving Time Bounds for Randomized Distributed Algorithms. - Nancy A. Lynch; Isaac Saias; Roberto Segala (PODC, 1994)

A Compositional Trace-Based Semantics for Probabilistic Automata. - Roberto Segala (CONCUR, 1995)

Hybrid I/O Automata. - Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager; Henri B. Weinberg (Hybrid Systems, 1995)

Formal Verification of Timed Properties for Randomized Distributed Algorithms. - Anna Pogosyants; Roberto Segala (PODC, 1995)

A Comparison of Simulation Techniques and Algebraic Tachniques for Verifying Concurrent Systems. - Nancy A. Lynch; Roberto Segala (Formal Aspects Comput., 1995)

Probabilistic Simulations for Probabilistic Processes. - Roberto Segala; Nancy A. Lynch (Nord. J. Comput., 1995)

A Process Algebraic View of Input/Output Automata. - Rocco De Nicola; Roberto Segala (Theor. Comput. Sci., 1995)

Modeling and verification of randomized distributed real-time systems. - Roberto Segala (1995)

Testing Probabilistic Automata. - Roberto Segala (CONCUR, 1996)

Compositional Verification of Randomized Distributed Algorithms. - Roberto Segala (COMPOS, 1997)

Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study. - Anna Pogosyants; Roberto Segala; Nancy A. Lynch (WDAG, 1997)

Quiescence, Fairness, Testing, and the Notion of Implementation. - Roberto Segala (Inf. Comput., 1997)

The Essence of Coin Lemmas. - Roberto Segala (PROBMIV, 1998)

Liveness in Timed and Untimed Systems. - Roberto Segala; Rainer Gawlick; Jørgen F. Søgaard-Andersen; Nancy A. Lynch (Inf. Comput., 1998)

System Support for Partition-Aware Network Applications. - Özalp Babaoglu; Renzo Davoli; Alberto Montresor; Roberto Segala (ACM SIGOPS Oper. Syst. Rev., 1998)

Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. - Marta Z. Kwiatkowska; Gethin Norman; Roberto Segala; Jeremy Sproston (CONCUR, 2000)

Verification of Randomized Distributed Algorithms. - Roberto Segala (European Educational Forum: School on Formal Methods and Performance Analysis, 2000)

Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation. - Luca de Alfaro; Marta Z. Kwiatkowska; Gethin Norman; David Parker 001; Roberto Segala (TACAS, 2000)

Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. - Anna Pogosyants; Roberto Segala; Nancy A. Lynch (Distributed Comput., 2000)

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM. - Marta Z. Kwiatkowska; Gethin Norman; Roberto Segala (CAV, 2001)

Hybrid I/O Automata Revisited. - Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (HSCC, 2001)

Axiomatizations for Probabilistic Bisimulation. - Emanuele Bandini; Roberto Segala (ICALP, 2001)

Coin Lemmas with Random Variables. - Katia Folegati; Roberto Segala (PAPM-PROBMIV, 2001)

Decision Algorithms for Probabilistic Bisimulation. - Stefano Cattani; Roberto Segala (CONCUR, 2002)

Automatic verification of real-time systems with discrete probability distributions. - Marta Z. Kwiatkowska; Gethin Norman; Roberto Segala; Jeremy Sproston (Theor. Comput. Sci., 2002)

Compositionality for Probabilistic Automata. - Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (CONCUR, 2003)

Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems. - Dilsun Kirli Kaynar; Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (RTSS, 2003)

Hybrid I/O automata. - Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (Inf. Comput., 2003)

Switched Probabilistic I/O Automata. - Ling Cheung; Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (ICTAC, 2004)

Axiomatization of Trace Semantics for Stochastic Nondeterministic Processes. - Augusto Parma; Roberto Segala (QEST, 2004)

Stochastic Transition Systems for Continuous State Spaces and Non-determinism. - Stefano Cattani; Roberto Segala; Marta Z. Kwiatkowska; Gethin Norman (FoSSaCS, 2005)

Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models. - Roberto Segala; Andrea Turrini (QEST, 2005)

Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. - Ran Canetti; Ling Cheung; Dilsun Kirli Kaynar; Moses D. Liskov; Nancy A. Lynch; Olivier Pereira; Roberto Segala (IACR Cryptol. ePrint Arch., 2005)

Probability and Nondeterminism in Operational Models of Concurrency. - Roberto Segala (CONCUR, 2006)

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. - Ran Canetti; Ling Cheung; Dilsun Kirli Kaynar; Moses D. Liskov; Nancy A. Lynch; Olivier Pereira; Roberto Segala (DISC, 2006)

Switched PIOA: Parallel composition via distributed scheduling. - Ling Cheung; Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (Theor. Comput. Sci., 2006)

Dynamic load balancing with group communication. - Shlomi Dolev; Roberto Segala; Alexander A. Shvartsman (Theor. Comput. Sci., 2006)

The Theory of Timed I/O Automata - Dilsun Kirli Kaynar; Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (Morgan & Claypool Publishers, 2006)

Approximated Computationally Bounded Simulation Relations for Probabilistic Automata. - Roberto Segala; Andrea Turrini (CSF, 2007)

Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. - Augusto Parma; Roberto Segala (FoSSaCS, 2007)

Observing Branching Structure through Probabilistic Contexts. - Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (SIAM J. Comput., 2007)

The power of simulation relations. - Roberto Segala (PODC, 2008)

Analyzing Security Protocols Using Time-Bounded Task-PIOAs. - Ran Canetti; Ling Cheung; Dilsun Kirli Kaynar; Moses D. Liskov; Nancy A. Lynch; Olivier Pereira; Roberto Segala (Discret. Event Dyn. Syst., 2008)

A quantitative doxastic logic for probabilistic processes and applications to information-hiding. - Simon Kramer 001; Catuscia Palamidessi; Roberto Segala; Andrea Turrini; Christelle Braun (J. Appl. Non Class. Logics, 2009)

Conditional Automata: A Tool for Safe Removal of Negligible Events. - Roberto Segala; Andrea Turrini (CONCUR, 2010)

Reasoning about Probabilistic Security Using Task-PIOAs. - Aaron D. Jaggard; Catherine Meadows 001; Michael W. Mislove; Roberto Segala (ARSPA-WITS, 2010)

The Theory of Timed I/O Automata, Second Edition - Dilsun Kirli Kaynar; Nancy A. Lynch; Roberto Segala; Frits W. Vaandrager (Morgan & Claypool Publishers, 2010)

Probabilistic Logical Characterization. - Holger Hermanns; Augusto Parma; Roberto Segala; Björn Wachter; Lijun Zhang 001 (Inf. Comput., 2011)

Distributed collision avoidance for autonomous vehicles: world automata representation. - Nicolae E. Marinica; Marta Capiluppi; Jonathan Rogge; Roberto Segala; René K. Boel (ADHS, 2012)

Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata - Marta Capiluppi; Roberto Segala (GandALF, 2012)

Selected papers from QEST 2010. - Gianfranco Ciardo; Roberto Segala (Perform. Evaluation, 2012)

World Automata: a compositional approach to model implicit communication in hierarchical Hybrid Systems. - Marta Capiluppi; Roberto Segala (HAS, 2013)

Random Measurable Selections. - Jean Goubault-Larrecq; Roberto Segala (Horizons of the Mind, 2014)

Task-structured probabilistic I/O automata. - Ran Canetti; Ling Cheung; Dilsun Kirli Kaynar; Moses D. Liskov; Nancy A. Lynch; Olivier Pereira; Roberto Segala (J. Comput. Syst. Sci., 2018)

A computable and compositional semantics for hybrid automata. - Davide Bresolin; Pieter Collins; Luca Geretti; Roberto Segala; Tiziano Villa; Sanja Zivanovic Gonzalez (HSCC, 2020)

A computable and compositional semantics for hybrid systems. - Davide Bresolin; Pieter Collins; Luca Geretti; Roberto Segala; Tiziano Villa; Sanja Zivanovic Gonzalez (Inf. Comput., 2024)