On decidability of LTL model checking for process rewrite systems Laura BozzelliMojmír KřetínskýJan Strejček Original Article 11 November 2008 Pages: 1 - 28
Exploiting colored Petri nets to decide on permutation admissibility Rza BashirovFabrice KordonHüseyin Lort Original Article 28 November 2008 Pages: 43 - 55
A complexity tradeoff in ranking-function termination proofs Amir M. Ben-Amram Original Article 03 December 2008 Pages: 57 - 72
A queue based mutual exclusion algorithm Alex A. AravindWim H. Hesselink Original Article 02 December 2008 Pages: 73 - 86