Volume 27, 1999
Eindhoven, The Netherlands, August 23, 1999

Simone Tini: On The Expressiveness of Timed Concurrent Constraint Programming. 3-17
Anna Ingólfsdóttir, Rosario Pugliese: Towards Verified Lazy Implementation of Concurrent Value-Passing Languages. 18-24
Rom Langerak: Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding. 25-41
Gabriel Juhás: Petri nets with generalized algebra: a comparison. 42-56
Massimo Merro: On Equators in Asynchronous Name-passing Calculi without Matching. 57-70
Heike Wehrheim: Partial order reductions for failures refinement. 71-84
Sibylle B. Fröschle: Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP. 85-106
Mario Bravetti, Roberto Gorrieri: Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement. 107-126



