The following pages link to Roberto Segala (Q627126):
Displaying 39 items.
- Probabilistic logical characterization (Q627128) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Dynamic load balancing with group communication (Q861278) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Liveness in timed and untimed systems (Q1271471) (← links)
- Quiescence, fairness, testing, and the notion of implementation (Q1376423) (← links)
- Hybrid I/O automata. (Q1427865) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- The Theory of Timed I/O Automata, Second Edition (Q3002201) (← links)
- The Theory of Timed I/O Automata (Q3006716) (← links)
- (Q3519383) (← links)
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols (Q3524308) (← links)
- Conditional Automata: A Tool for Safe Removal of Negligible Events (Q3584954) (← links)
- (Q4255549) (← links)
- (Q4484499) (← links)
- (Q4535031) (← links)
- (Q4536598) (← links)
- (Q4547768) (← links)
- (Q4551150) (← links)
- (Q4552483) (← links)
- Modeling Objects Moving in a Complex Environment with World Automata (Q4560622) (← links)
- Liveness in timed and untimed systems (Q4632424) (← links)
- (Q4798034) (← links)
- (Q4847023) (← links)
- (Q4986501) (← links)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
- A computable and compositional semantics for hybrid automata (Q5146382) (← links)
- A quantitative doxastic logic for probabilistic processes and applications to information-hiding (Q5188177) (← links)
- Proving time bounds for randomized distributed algorithms (Q5361423) (← links)
- Formal verification of timed properties of randomized distributed algorithms (Q5361452) (← links)
- Random Measurable Selections (Q5418972) (← links)
- Foundations of Software Science and Computational Structures (Q5705913) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709998) (← links)
- Probability and Nondeterminism in Operational Models of Concurrency (Q5756588) (← links)
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems (Q5758058) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900567) (← links)
- A computable and compositional semantics for hybrid systems (Q6614877) (← links)
