Electronic Notes in Theoretical Computer Science, Volume 96

Volume 96, 9 June 2004

• Flavio Corradini, Uwe Nestmann:
  Foreword: Proceedings of the 10th International Workshop on Expressiveness in Concurrency. 1-3
  
• Luca Aceto:
  Nested Semantics over Finite Trees are Equationally Hard: Invited Talk. 5-6
  
• Michael W. Mislove, Joël Ouaknine, James Worrell:
  Axioms for Probability and Nondeterminism. 7-28
  
• Sergio Maffeis, Iain Phillips:
  On the Computational Strength of Pure Ambient Calculi. 29-49
  
• Étienne Lozes:
  Adjuncts elimination in the static ambient logic. 51-72
  
• Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi:
  On the Representation of McCarthy's amb in the -calculus. 73-89
  
• Ruggero Lanotte:
  Expressive Power of Hybrid Systems with Variables, Parameters and Arrays. 91-112
  
• Harald Fecher:
  Event Structures for Interrupt Process Algebras. 113-127
  
• Christie Bolton, Gavin Lowe:
  A Hierarchy of Failures-Based Models. 129-152
  
• Richard Mayr:
  Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard. 153-172