Theoretical Computer Science, Volume 179

Volume 179, Numbers 1-2, 1 June 1997

• Stephen L. Bloom, Zoltán Ésik:
  The Equational Logic of Fixed Points (Tutorial). 1-60
  
• N. W. Keesmaat, H. C. M. Kleijn:
  Restrictions and Representations of Vector Controlled Concurrent System Behaviours. 61-102
  
• Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude:
  A Calculational Approach to Mathematical Induction. 103-135
  
• Chantal Berline, Klaus Grue:
  A kappa-Denotational Semantics for Map Theory in ZFC + SI. 137-202
  
• Ilaria Castellani, Guo-Qiang Zhang:
  Parallel Product of Event Structures. 203-215
  
• Christel Baier:
  Trees and Semantics. 217-250
  
• Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
  Succinctness of Descriptions of SBTA-Languages. 251-271
  
• Suad Alagic, Mara Alagic:
  Order-Sorted Model Theory for Temporal Executable Specifications. 273-299
  
• Hsu-Chun Yen:
  On Reachability Equivalence for BPP-Nets. 301-317
  
• Inger Sigstam, Viggo Stoltenberg-Hansen:
  Representability of Locally Compact Regular Spaces by Domains and Formal Spaces. 319-331
  
• Leslie Lamport:
  Processes are in the Eye of the Beholder. 333-351
  
• Yuri Gurevich, James K. Huggins:
  Equivalence is in the Eye of the Beholder. 353-380
  
• Oscar H. Ibarra, Nicholas Q. Trân, Tao Yang:
  On the Parallel Complexity of Loops. 381-395
  
• Jaana Eloranta, Martti Tienari, Antti Valmari:
  Essential Transitions to Bisimulation Equivalences. 397-419
  
• Jürgen Koslowski:
  Note on Free Algebras Over Continuous Domains. 421-425
  
• Ivo Düntsch:
  A Logic for Rough Sets. 427-436