Journals in DBLP

Theor. Comput. Sci.
2007, volume: 379, number: 1-2

1. Jan Friso Groote, Marc Voorhoeve
   Operational semantics for Petri net components. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:1-19 [Journal]
   
2. Giorgi Japaridze
   From truth to computability II. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:20-52 [Journal]
   
3. Manuel A. Martins
   Closure properties for the class of behavioral models. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:53-83 [Journal]
   
4. Max I. Kanovich, Jacqueline Vauzeilles
   Strong planning under uncertainty in domains with numerous but identical elements (a generic approach). [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:84-119 [Journal]
   
5. J. Raymundo Marcial-Romero, Martín Hötzel Escardó
   Semantics of a sequential language for exact real-number computation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:120-141 [Journal]
   
6. Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas
   Reasoning about probabilistic sequential programs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:142-165 [Journal]
   
7. Lionel Vaux
   The differential lambdamu-calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:166-209 [Journal]
   
8. Razvan Diaconescu, Petros Stefaneas
   Ultraproducts and possible worlds semantics in institutions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:210-230 [Journal]
   
9. Eugene Asarin, Gerardo Schneider, Sergio Yovine
   Algorithmic analysis of polygonal hybrid systems, part I: Reachability. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:379, n:1-2, pp:231-265 [Journal]
   
10. Anuj Dawar, Stephan Kreutzer
    Generalising automaticity to modal properties of finite structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:266-285 [Journal]
    
11. Laura Bozzelli
    Complexity results on branching-time pushdown model checking. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:286-297 [Journal]
    
12. Sándor Vágvölgyi
    Losing recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:298-304 [Journal]