Verification of infinite state systems, Infinity '96. Selected papers from the 1st international workshop, Univ. of Pisa, Italy, August 30--31, 1996 (Q1273553)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Mayr, Richard}, Semantic reachability, 11 p. [Zbl 0911.68055] \textit{Hirshfeld, Yoram}, Bisimulation trees and the decidability of weak bisimulations, 12 p. [Zbl 0911.68151] \textit{Kouchnarenko, Olga; Schnoebelen, Ph.}, A model for recursive-parallel programs, 12 p. [Zbl 0912.68131] \textit{Paczkowski, Pawel}, Characterizing bisimilarity of value-passing parametrized processes, 13 p. [Zbl 0911.68152] \textit{Burkart, Olaf; Quemener, Yves-Marie}, Model-checking of infinite graphs defined by graph grammars, 15 p. [Zbl 0911.68105] \textit{Gurov, Dilian; Brezin, Sergei; Kapron, B. M.}, A modal \(\mu\)-calculus and a proof system for value passing processes, 15 p. [Zbl 0912.68185] \textit{Nesi, Monica}, Mechanising a modal logic for value-passing agents in HOL, 16 p. [Zbl 0912.68194] \textit{Cridlig, Régis}, Semantic analysis of concurrent ML by abstract model-checking, 18 p. [Zbl 0911.68125] \textit{Burkart, Olaf; Esparza, Javier}, More infinite results, 20 p. [Zbl 0943.68062] \textit{Černá, I.; Křetínský, M.; Kučera, A.}, Bisimilarity is decidable in the union of normed BPA and normed BPP processes, 24 p. [Zbl 0911.68065]