1. Hardness of equivalence checking for composed finite-state systems

   • Zdeněk Sawa
   • Petr Jančar

   Original Article 13 January 2009 Pages: 169 - 191

2. On the closure of pattern expressions languages under intersection with regular languages

   • Cezar Câmpeanu
   • Nicolae Santean

   Original Article 24 February 2009 Pages: 193 - 207

3. Liveness of a mutex algorithm in a fair process algebra

   • Flavio Corradini
   • Maria Rita Di Berardini
   • Walter Vogler

   Original Article 24 March 2009 Pages: 209 - 235

4. A decomposition theorem for finite persistent transition systems

   • Eike Best
   • Philippe Darondeau

   Original Article 20 March 2009 Pages: 237 - 254