Basic Research in Computer Science

Regular Tree Model Checking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 A. Boujjani, P. Habermehl, A. Rogalewicz and T. Vojnar Automatic Verification of Fault-Tolerant Register Emulations . . . . . . . . . . . . . . . . . . . . . . . 25 P.C. Attie and H. Chockler Algorithmic Algebraic Model Checking III: Approximate Methods . . . . . . . . . . . . . . . . . 37 V. Mysore and B. Mishra Liveness Checking as Safety Checking for Infinite State Spaces . . . . . . . . . . . . . . . . . . . . . 53 V. Schuppan and A. Biere v vi Methods for Quantitative Analysis of Probabilistic Pushdown Automata Antonn Kucera Faculty of Informatics, Masaryk University in Brno Botanicka 68a, 60200 Brno, Czech Republic We present several constructions and techniques which have recently been used to tackle the problems of qualitative/quantitative analysis of probabilistic pushdown automata