| 09:00 |
Opening |
| 09:10-10:00 |
Catuscia Palamidessi |
| On the Expressive Power of Temporal Concurrent Constraint Programming Languages |
| 10:00-10:30 |
Daniele Beauquier, Yoram Hirshfeld, Alexander Rabinovich, Anatol Slissenko |
| The Probability Nesting Game |
| 10:30-11:00 |
Break |
| 11:00-11:30 |
Marco Carbone, Sergio Maffeis |
| On the Expressive Power of Polyadic Synchronisation in pi-calculus |
| 11:30-12:00 |
Rance Cleaveland, Gerald Lüttgen |
| A Logical Process Calculus |
| 12:00-12:30 |
Maribel Fernandez, Lionel Khalil |
| Interaction Nets with McCarthy's amb |
| 12:30-14:10 |
Lunch |
| 14:10-15:00 |
Igor Walukiewicz |
| Describing Properties of Concurrent Systems |
| 15:00-15:30 |
Martin Lange |
| Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition |
| 15:30-16:00 |
Nicolas Markey |
| Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past |
| 16:00-16:30 |
Break |
| 16:30-17:00 |
Vladimiro Sassone, Pawel Sobocinski |
| Deriving Bisimulation Congruences: A 2-categorical Approach |
| 17:00-17:30 |
Ulrik Frendrup, Hans Hüttel, Jesper Nyholm Jensen |
| Modal Logics for Cryptographic Processes |
| 17:30-18:00 |
Joel Ouaknine, James Worrell |
| Timed CSP = Closed Timed Safety Automata |
| 18:00 |
Closing |
