Theoretical Computer Science, Volume 256

Volume 256, Number 1-2, 6 April 2001

• Ahmed Bouajjani:
  Preface. 1-2
  
• Yoram Hirshfeld, Faron Moller:
  Pushdown automata, multiset automata, and Petri nets. 3-21
  
• Petr Jancar:
  Nonprimitive recursive complexity and undecidability for Petri net equivalences. 23-30
  
• Richard Mayr:
  Decidability of model checking with the temporal logic EF. 31-62
  
• Alain Finkel, Ph. Schnoebelen:
  Well-structured transition systems everywhere! 63-92
  
• Yonit Kesten, Oded Maler, Monica Marcus, Amir Pnueli, Elad Shahar:
  Symbolic model checking with rich assertional languages. 93-112
  
• David Lesens, Nicolas Halbwachs, Pascal Raymond:
  Automatic verification of parameterized networks of processes. 113-144
  
• Parosh Aziz Abdulla, Bengt Jonsson:
  Ensuring completeness of symbolic verification methods for infinite-state systems. 145-167