Electronic Notes in Theoretical Computer Science, Volume 149

Volume 149, Number 1, February 2006

• Jirí Srba, Scott A. Smolka:
  Preface. 1-2
  
• Antonín Kucera:
  Methods for Quantitative Analysis of Probabilistic Pushdown Automata. 3-15
  
• Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
  Refining the Undecidability Border of Weak Bisimilarity. 17-36
  
• Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar:
  Abstract Regular Tree Model Checking. 37-48
  
• Paul C. Attie, Hana Chockler:
  Automatic Verification of Fault-Tolerant Register Emulations. 49-60
  
• Venkatesh Mysore, Bud Mishra:
  Algorithmic Algebraic Model Checking III: Approximate Methods. 61-77
  
• Viktor Schuppan, Armin Biere:
  Liveness Checking as Safety Checking for Infinite State Spaces. 79-96
  

Volume 149, Number 2, February 2006

• Charles Pecheur, Brian Williams:
  Preface. 1-2
  
• Stefan Edelkamp, Shahid Jabbar:
  Action Planning for Directed Model Checking of Petri Nets. 3-18
  
• Gihwon Kwon:
  Relay Reachability Algorithm for Exploring Huge State Space. 19-31
  
• Kairong Qian, Albert Nymeyer:
  Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis. 33-49
  
• Tilman Mehler, Stefan Edelkamp:
  Dynamic Incremental Hashing in Program Model Checking. 51-69
  
• David J. Musliner, Michael J. S. Pelican, Robert P. Goldman:
  Incremental Verification for On-the-Fly Controller Synthesis. 71-90
  
• Sylvain Kerjean, Froduald Kabanza, Richard St.-Denis, Sylvie Thiébaux:
  Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress). 91-104
  
• Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van der Meyden, Ji Ruan:
  Model Checking Russian Cards. 105-123
  
• Paolo Ballarini, Michael Fisher, Michael Wooldridge:
  Automated Game Analysis via Probabilistic Model Checking: a case study. 125-137
  
• Dan Lawesson, Ulf Nilsson, Inger Klein:
  An Approach to Post Mortem Diagnosability Analysis for Interacting Finite State Systems. 139-153