Electronic Notes in Theoretical Computer Science, Volume 27

Volume 27, 1999

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