Electronic Notes in Theoretical Computer Science, Volume 5

Volume 5, 1996

• Bernhard Steffen:
  Preface.
  
• Yoram Hirshfeld:
  Bisimulation trees and the decidability of weak bisimulations.
  
• Ivana Cerná, Mojmír Kretínský, Antonín Kucera:
  Bisimilarity is decidable in the union of normed BPA and normed BPP processes.
  
• Pawel Paczkowski:
  Characterizing bisimilarity of value-passing parametrised processes.
  
• Olaf Burkart, Yves-Marie Quemener:
  Model-checking of infinite graphs defined by graph grammars.
  
• Régis Cridlig:
  Semantic analysis of concurrent ML by abstract model-checking.
  
• Richard Mayr:
  Semantic reachability.
  
• Olaf Burkart, Javier Esparza:
  More infinite results.
  
• Olga Kouchnarenko, Ph. Schnoebelen:
  A model for recursive-parallel programs.
  
• Monica Nesi:
  Mechanising a modal logic for value-passing agents in HOL.
  
• Dilian Gurov, Sergey Berezin, Bruce M. Kapron:
  A modal mu-calculus and a proof system for value passing processes.