| 09:00 |
Opening |
| 09:10-10:00 |
Luca Aceto |
| Nested Semantics over Finite Trees are Equationally Hard |
| 10:00-10:30 |
Michael Mislove, Joel Ouaknine, James Worrell |
| Axioms for Probability and Nondeterminism |
| 10:30-11:00 |
Break |
| 11:00-11:30 |
Sergio Maffeis, Iain Phillips |
| On the Computational Strength of Pure Ambient Calculi |
| 11:30-12:00 |
Etienne Lozes |
| Adjuncts elimination in the static ambient logic |
| 12:00-12:30 |
Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi |
| On the representation of McCarthy's Amb in the pi-calculus |
| 12:30-14:10 |
Lunch |
| 14:10-15:00 |
Michel Raynal |
| Distributed Agreement and its relation with Error-Correcting Codes |
| 15:00-15:30 |
Ruggero Lanotte |
| Expressive Power of Hybrid Systems with Variables, Parameters and Arrays |
| 15:30-16:00 |
Frank Valencia |
| On the Decidability of Timed Concurrent Constraint Programming |
| 16:00-16:30 |
Break |
| 16:30-17:00 |
Harald Fecher |
| Event Structures for Interrupt Process Algebras |
| 17:00-17:30 |
Christie Bolton, Gavin Lowe |
| A Hierarchy of Failures-Based Models |
| 17:30-18:00 |
Richard Mayr |
| Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard |
| 18:00 |
Closing |
