Journals in DBLP

Theor. Comput. Sci.
2001, volume: 256, number: 1-2

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