Roberto Segala

Orcid: 0000-0001-5586-3362

Affiliations:
  • University of Verona, Italy


According to our database1, Roberto Segala authored at least 57 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A computable and compositional semantics for hybrid systems.
Inf. Comput., 2024

2020
A computable and compositional semantics for hybrid automata.
Proceedings of the HSCC '20: 23rd ACM International Conference on Hybrid Systems: Computation and Control, 2020

2018
Task-structured probabilistic I/O automata.
J. Comput. Syst. Sci., 2018

2014
Random Measurable Selections.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
World Automata: a compositional approach to model implicit communication in hierarchical Hybrid Systems.
Proceedings of the Proceedings Third International Workshop on Hybrid Autonomous Systems, 2013

2012
Selected papers from QEST 2010.
Perform. Evaluation, 2012

Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata
Proceedings of the Proceedings Third International Symposium on Games, 2012

Distributed collision avoidance for autonomous vehicles: world automata representation.
Proceedings of the 4th IFAC Conference on Analysis and Design of Hybrid Systems, 2012

2011
Probabilistic Logical Characterization.
Inf. Comput., 2011

2010
The Theory of Timed I/O Automata, Second Edition
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02003-2, 2010

Reasoning about Probabilistic Security Using Task-PIOAs.
Proceedings of the Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, 2010

Conditional Automata: A Tool for Safe Removal of Negligible Events.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
A quantitative doxastic logic for probabilistic processes and applications to information-hiding.
J. Appl. Non Class. Logics, 2009

2008
Analyzing Security Protocols Using Time-Bounded Task-PIOAs.
Discret. Event Dyn. Syst., 2008

The power of simulation relations.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Observing Branching Structure through Probabilistic Contexts.
SIAM J. Comput., 2007

Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Approximated Computationally Bounded Simulation Relations for Probabilistic Automata.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

2006
The Theory of Timed I/O Automata
Synthesis Lectures on Computer Science, Morgan & Claypool Publishers, 2006

Dynamic load balancing with group communication.
Theor. Comput. Sci., 2006

Switched PIOA: Parallel composition via distributed scheduling.
Theor. Comput. Sci., 2006

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Probability and Nondeterminism in Operational Models of Concurrency.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol.
IACR Cryptol. ePrint Arch., 2005

Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models.
Proceedings of the Second International Conference on the Quantitative Evaluaiton of Systems (QEST 2005), 2005

Stochastic Transition Systems for Continuous State Spaces and Non-determinism.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Axiomatization of Trace Semantics for Stochastic Nondeterministic Processes.
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Switched Probabilistic I/O Automata.
Proceedings of the Theoretical Aspects of Computing, 2004

2003
Hybrid I/O automata.
Inf. Comput., 2003

Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems.
Proceedings of the 24th IEEE Real-Time Systems Symposium (RTSS 2003), 2003

Compositionality for Probabilistic Automata.
Proceedings of the CONCUR 2003, 2003

2002
Automatic verification of real-time systems with discrete probability distributions.
Theor. Comput. Sci., 2002

Decision Algorithms for Probabilistic Bisimulation.
Proceedings of the CONCUR 2002, 2002

2001
Coin Lemmas with Random Variables.
Proceedings of the Process Algebra and Probabilistic Methods, 2001

Axiomatizations for Probabilistic Bisimulation.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Hybrid I/O Automata Revisited.
Proceedings of the Hybrid Systems: Computation and Control, 4th International Workshop, 2001

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study.
Distributed Comput., 2000

Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Verification of Randomized Distributed Algorithms.
Proceedings of the Lectures on Formal Methods and Performance Analysis, 2000

Verifying Quantitative Properties of Continuous Probabilistic Timed Automata.
Proceedings of the CONCUR 2000, 2000

1998
System Support for Partition-Aware Network Applications.
ACM SIGOPS Oper. Syst. Rev., 1998

Liveness in Timed and Untimed Systems.
Inf. Comput., 1998

The Essence of Coin Lemmas.
Proceedings of the First International Workshop on Probabilistic Methods in Verification, 1998

1997
Quiescence, Fairness, Testing, and the Notion of Implementation.
Inf. Comput., 1997

Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Compositional Verification of Randomized Distributed Algorithms.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997

1996
Testing Probabilistic Automata.
Proceedings of the CONCUR '96, 1996

1995
Modeling and verification of randomized distributed real-time systems.
PhD thesis, 1995

A Process Algebraic View of Input/Output Automata.
Theor. Comput. Sci., 1995

Probabilistic Simulations for Probabilistic Processes.
Nord. J. Comput., 1995

A Comparison of Simulation Techniques and Algebraic Tachniques for Verifying Concurrent Systems.
Formal Aspects Comput., 1995

Formal Verification of Timed Properties for Randomized Distributed Algorithms.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Hybrid I/O Automata.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

A Compositional Trace-Based Semantics for Probabilistic Automata.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
Proving Time Bounds for Randomized Distributed Algorithms.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract).
Proceedings of the CONCUR '93, 1993


  Loading...