default search action
Roberto Segala
Person information
- affiliation: University of Verona, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Davide Bresolin
, Pieter Collins
A computable and compositional semantics for hybrid systems. Inf. Comput. 300: 105189 (2024) - 2020
- [c40]Davide Bresolin
A computable and compositional semantics for hybrid automata. HSCC 2020: 18:1-18:11
2010 – 2019
- 2018
- [j17]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar
Task-structured probabilistic I/O automata. J. Comput. Syst. Sci. 94: 63-97 (2018) - 2014
- [c39]Jean Goubault-Larrecq, Roberto Segala
Random Measurable Selections. Horizons of the Mind 2014: 343-362 - 2013
- [c38]Marta Capiluppi, Roberto Segala
World Automata: a compositional approach to model implicit communication in hierarchical Hybrid Systems. HAS 2013: 58-72 - 2012
- [j16]Gianfranco Ciardo, Roberto Segala
Selected papers from QEST 2010. Perform. Evaluation 69(7-8): 297-298 (2012) - [c37]Nicolae E. Marinica, Marta Capiluppi, Jonathan Rogge, Roberto Segala
Distributed collision avoidance for autonomous vehicles: world automata representation. ADHS 2012: 216-221 - [c36]Marta Capiluppi, Roberto Segala
Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata. GandALF 2012: 1-14 - 2011
- [j15]Holger Hermanns
Probabilistic Logical Characterization. Inf. Comput. 209(2): 154-172 (2011) - 2010
- [b3]Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
The Theory of Timed I/O Automata, Second Edition. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2010, ISBN 978-3-031-00875-7 - [c35]Roberto Segala
Conditional Automata: A Tool for Safe Removal of Negligible Events. CONCUR 2010: 539-553 - [c34]Aaron D. Jaggard
Reasoning about Probabilistic Security Using Task-PIOAs. ARSPA-WITS 2010: 2-22
2000 – 2009
- 2009
- [j14]Simon Kramer
A quantitative doxastic logic for probabilistic processes and applications to information-hiding. J. Appl. Non Class. Logics 19(4): 489-516 (2009) - 2008
- [j13]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala
Analyzing Security Protocols Using Time-Bounded Task-PIOAs. Discret. Event Dyn. Syst. 18(1): 111-159 (2008) - [c33]Roberto Segala:
The power of simulation relations. PODC 2008: 462 - 2007
- [j12]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Observing Branching Structure through Probabilistic Contexts. SIAM J. Comput. 37(4): 977-1013 (2007) - [c32]Roberto Segala
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata. CSF 2007: 140-156 - [c31]Augusto Parma, Roberto Segala:
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. FoSSaCS 2007: 287-301 - 2006
- [b2]Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala
The Theory of Timed I/O Automata. Synthesis Lectures on Computer Science, Morgan & Claypool Publishers 2006 - [j11]Ling Cheung, Nancy A. Lynch, Roberto Segala
Switched PIOA: Parallel composition via distributed scheduling. Theor. Comput. Sci. 365(1-2): 83-108 (2006) - [j10]Shlomi Dolev
Dynamic load balancing with group communication. Theor. Comput. Sci. 369(1-3): 348-360 (2006) - [c30]Roberto Segala:
Probability and Nondeterminism in Operational Models of Concurrency. CONCUR 2006: 64-78 - [c29]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. DISC 2006: 238-253 - 2005
- [c28]Stefano Cattani, Roberto Segala, Marta Z. Kwiatkowska, Gethin Norman:
Stochastic Transition Systems for Continuous State Spaces and Non-determinism. FoSSaCS 2005: 125-139 - [c27]Roberto Segala
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models. QEST 2005: 44-53 - [i2]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. IACR Cryptol. ePrint Arch. 2005: 452 (2005) - 2004
- [c26]Ling Cheung, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Switched Probabilistic I/O Automata. ICTAC 2004: 494-510 - [c25]Augusto Parma, Roberto Segala
Axiomatization of Trace Semantics for Stochastic Nondeterministic Processes. QEST 2004: 294-303 - 2003
- [j9]Nancy A. Lynch, Roberto Segala
Hybrid I/O automata. Inf. Comput. 185(1): 105-157 (2003) - [c24]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Compositionality for Probabilistic Automata. CONCUR 2003: 204-222 - [c23]Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems. RTSS 2003: 166-177 - 2002
- [j8]Marta Z. Kwiatkowska, Gethin Norman
Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci. 282(1): 101-150 (2002) - [c22]Stefano Cattani, Roberto Segala:
Decision Algorithms for Probabilistic Bisimulation. CONCUR 2002: 371-385 - [e1]Holger Hermanns
Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25-26, 2002, Proceedings. Lecture Notes in Computer Science 2399, Springer 2002, ISBN 3-540-43913-7 [contents] - 2001
- [c21]Marta Z. Kwiatkowska, Gethin Norman
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM. CAV 2001: 194-206 - [c20]Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Hybrid I/O Automata Revisited. HSCC 2001: 403-417 - [c19]Emanuele Bandini, Roberto Segala:
Axiomatizations for Probabilistic Bisimulation. ICALP 2001: 370-381 - [c18]Katia Folegati, Roberto Segala:
Coin Lemmas with Random Variables. PAPM-PROBMIV 2001: 71-86 - 2000
- [j7]Anna Pogosyants, Roberto Segala
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Comput. 13(3): 155-186 (2000) - [c17]Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. CONCUR 2000: 123-137 - [c16]Roberto Segala:
Verification of Randomized Distributed Algorithms. European Educational Forum: School on Formal Methods and Performance Analysis 2000: 232-260 - [c15]Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norman, David Parker
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation. TACAS 2000: 395-410
1990 – 1999
- 1999
- [c14]Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
Automatic Verification of Real-Time Systems with Discrete Probability Distributions. ARTS 1999: 75-95 - [c13]Shlomi Dolev, Roberto Segala, Alexander A. Shvartsman:
Dynamic Load Balancing with Group Communication. SIROCCO 1999: 111-125 - 1998
- [j6]Roberto Segala
Liveness in Timed and Untimed Systems. Inf. Comput. 141(2): 119-171 (1998) - [j5]Özalp Babaoglu
System Support for Partition-Aware Network Applications. ACM SIGOPS Oper. Syst. Rev. 32(1): 41-56 (1998) - [c12]Özalp Babaoglu, Renzo Davoli, Alberto Montresor, Roberto Segala:
System Support for Partition-Aware Network Applications. ICDCS 1998: 184-191 - [c11]Roberto Segala
The Essence of Coin Lemmas. PROBMIV 1998: 188-207 - 1997
- [j4]Roberto Segala
Quiescence, Fairness, Testing, and the Notion of Implementation. Inf. Comput. 138(2): 194-210 (1997) - [c10]Roberto Segala:
Compositional Verification of Randomized Distributed Algorithms. COMPOS 1997: 515-540 - [c9]Anna Pogosyants, Roberto Segala, Nancy A. Lynch:
Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study. WDAG 1997: 22-36 - 1996
- [c8]Roberto Segala:
Testing Probabilistic Automata. CONCUR 1996: 299-314 - 1995
- [b1]Roberto Segala:
Modeling and verification of randomized distributed real-time systems. Massachusetts Institute of Technology, Cambridge, MA, USA, 1995 - [j3]Nancy A. Lynch, Roberto Segala
A Comparison of Simulation Techniques and Algebraic Tachniques for Verifying Concurrent Systems. Formal Aspects Comput. 7(3): 231-265 (1995) - [j2]Roberto Segala, Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273 (1995) - [j1]Rocco De Nicola, Roberto Segala
A Process Algebraic View of Input/Output Automata. Theor. Comput. Sci. 138(2): 391-423 (1995) - [c7]Roberto Segala:
A Compositional Trace-Based Semantics for Probabilistic Automata. CONCUR 1995: 234-248 - [c6]Nancy A. Lynch, Roberto Segala
Hybrid I/O Automata. Hybrid Systems 1995: 496-510 - [c5]Anna Pogosyants, Roberto Segala:
Formal Verification of Timed Properties for Randomized Distributed Algorithms. PODC 1995: 174-183 - 1994
- [c4]Roberto Segala, Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes. CONCUR 1994: 481-496 - [c3]Rainer Gawlick, Roberto Segala, Jørgen F. Søgaard-Andersen, Nancy A. Lynch:
Liveness in Timed and Untimed Systems. ICALP 1994: 166-177 - [c2]Nancy A. Lynch, Isaac Saias, Roberto Segala
Proving Time Bounds for Randomized Distributed Algorithms. PODC 1994: 314-323 - [i1]Nancy A. Lynch, Isaac Saias, Roberto Segala:
Proving time bounds for randomized distributed algorithms. CoRR abs/math/9409221 (1994) - 1993
- [c1]Roberto Segala:
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract). CONCUR 1993: 324-338
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: