1. On decidability of LTL model checking for process rewrite systems

   • Laura Bozzelli
   • Mojmír Křetínský
   • Jan Strejček

   Original Article 11 November 2008 Pages: 1 - 28

2. Semi-synchronous transductions

   • Vince Bárány

   Original Article 06 November 2008 Pages: 29 - 42

3. Exploiting colored Petri nets to decide on permutation admissibility

   • Rza Bashirov
   • Fabrice Kordon
   • Hüseyin Lort

   Original Article 28 November 2008 Pages: 43 - 55

4. A complexity tradeoff in ranking-function termination proofs

   • Amir M. Ben-Amram

   Original Article 03 December 2008 Pages: 57 - 72

5. A queue based mutual exclusion algorithm

   • Alex A. Aravind
   • Wim H. Hesselink

   Original Article 02 December 2008 Pages: 73 - 86