Journals in DBLP

Electr. Notes Theor. Comput. Sci.
2004, volume: 98, number:

1. Ph. Schnoebelen
   Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:1- [Journal]
   
2. Anders Møller
   Verifying Programs that Manipulate Pointers: (Invited Talk). [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:3-4 [Journal]
   
3. Jirí Srba
   Completeness Results for Undecidable Bisimilarity Problems. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:5-19 [Journal]
   
4. Giorgio Delzanno
   A Symbolic Procedure for Control Reachability in the Asynchronous Pi-calculus: Extended Abstract. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:21-33 [Journal]
   
5. Jean-François Raskin, Laurent Van Begin
   Petri Nets with Non-blocking Arcs are Difficult to Analyze. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:35-55 [Journal]
   
6. Olga Grinchtein, Martin Leucker
   Network Invariants for Real-Time Systems. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:57-74 [Journal]
   
7. Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
   On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:75-88 [Journal]
   
8. Jérôme Leroux
   The Affine Hull of a Binary Automaton is Computable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:89-104 [Journal]