Theoretical Computer Science, Volume 195

Volume 195, Number 1, 20 March 1998

• Arie de Bruin, Shan-Hwei Nienhuys-Cheng:
  Linear Dynamic Kahn Networks are Deterministic. 3-32
  
• Stéphane Demri:
  A Class of Decidable Information Logics. 33-60
  
• Zoltán Ésik, Anna Labella:
  Equational Properties of Iteration in Algebraically Complete Categories. 61-89
  
• Patrice Séébold:
  On the Conjugation of Standard Morphisms. 91-109
  

Volume 195, Number 2, 30 March 1998

• Colin Stirling:
  Decidability of Bisimulation Equivalence for Normed Pushdown Processes. 113-131
  
• Julian C. Bradfield:
  The Modal µ-Calculus Alternation Hierarchy is Strict. 133-153
  
• Andrew M. Pitts, Joshua R. X. Ross:
  Process Calculus Based Upon Evaluation to Committed Form. 155-182
  
• Doron Peled, Thomas Wilke, Pierre Wolper:
  An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. 183-203
  
• Michele Boreale:
  On the Expressiveness of Internal Mobility in Name-Passing Calculi. 205-226
  
• Rance Cleaveland, Gerald Lüttgen, V. Natarajan:
  A Process Algebra with Distributed Priorities. 227-258
  
• Anna Philippou, David Walker:
  On Transformations of Concurrent-Object Programs. 259-289
  
• Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi:
  On Bisimulations for the Asynchronous pi-Calculus. 291-324