6th International Workshop on
Expressiveness in Concurrency
Monday, August 23, 1999


8.15 - 9.00Registration
9.00 - 9.10Opening
Chair: Catuscia Palamidessi
9.10 - 10.00Invited talk: Prakash Panangaden: Concurrent Constraint Programming as a Linear Realizability Algebra
10.00 - 10.35 Simone Tini: On The Expressiveness of Timed Concurrent Constraint Programming
10.35 - 11.10 Anna Ingolfsdottir and Rosario Pugliese: Towards Verified Lazy Implementation of Concurrent Value-Passing Languages
Coffee break
Chair: Ugo Montanari
11.30 - 12.05 Rom Langerak: Deriving a Graph Grammar from a Complete Finite Prefix of an Unfolding
12.05 - 12.40 Gabriel Juhas: Petri nets with generalised algebra: a comparison
Chair: Uwe Nestmann
14.00 - 14.50Invited talk: Roberto Amadio: Two Applications of the pi-Calculus
14.50 - 15.25 Lucian Wischik and Philippa Gardner: Symmetric Action Calculi
15.25 - 16.00 Massimo Merro: On Equators in Asynchronous Name-passing Calculi without Matching
Coffee break
Chair: Rob van Glabbeek
16.20 - 16.55 Heike Wehrheim: Partial order reductions for failures refinement
16.55 - 17.30 Sibylle Fröschle: Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP
17.30 - 18.05 Mario Bravetti and Roberto Gorrieri: Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement