Volume 7, 1997

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

last updated on Fri May 24 06:01:30 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page