Volume 5, 1996

Infinity'96, First International Workshop on Verification of Infinite State Systems
Università di Pisa, Pisa, Italy, August 30-31, 1996

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