Electronic Notes in Theoretical Computer Science, Volume 7

Volume 7, 1997

• Catuscia Palamidessi, Joachim Parrow:
  Foreword.
  
• Luca Aceto, Hans Hüttel, Anna Ingólfsdóttir, Josva Kleist:
  Relating semantic models for the object calculus.
  
• Zena M. Ariola, Jan Willem Klop, Detlef Plump:
  Confluent rewriting of bisimilar term graphs.
  
• Ralph-Johan Back, Joakim von Wright:
  Contracts, games and refinement.
  
• Christel Baier, Marta Z. Kwiatkowska:
  Domain equations for probabilistic processes.
  
• Roberto Bruni, Ugo Montanari:
  Zero-safe nets, or transition synchronization made simple.
  
• Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro:
  On the Turing equivalence of Linda coordination primitives.
  
• Flavio Corradini:
  Absolute versus relative time in process algebras.
  
• Flavio Corradini, Gian Luigi Ferrari, Marco Pistore:
  Eager, busy-waiting and lazy actions in timed computation?
  
• Gian Luigi Ferrari, Ugo Montanari:
  Tiles for concurrent and located calculi?
  
• Thomas Gehrke, Arend Rensink:
  Process creation and full sequential composition in a name-passing calculus.
  
• François Laroussinie, Ph. Schnoebelen:
  Specification in CTL+Past, verification in CTL.
  
• Richard Mayr:
  Process rewrite systems.
  
• Uwe Nestmann:
  What is a `good' encoding of guarded choice?
  
• Vaughan R. Pratt:
  Types as processes, via Chu spaces.
  
• Alexander Moshe Rabinovich:
  On expressive completeness of duration and mean value calculi.
  
• Arend Rensink:
  Bisimilarity of open terms.