Theoretical Computer Science, Volume 254

Volume 254, Number 1-2, 6 March 2001

• Laura Recalde, Enrique Teruel, Manuel Silva:
  Structure theory of multi-level deterministically synchronized sequential processes. 1-33
  
• Anna Ingólfsdóttir, Andrea Schalk:
  A fully abstract denotational model for observational precongruence. 35-61
  
• François Monin, Marianne Simonot:
  An ordinal measure based procedure for termination of functions. 63-94
  
• Pedro Resende:
  Quantales, finite observations and strong bisimulation. 95-149
  
• Tristan Crolard:
  Subtractive logic. 151-185
  
• R. Ramesh, I. V. Ramakrishnan, R. C. Sekar:
  Automata-driven efficient subterm unification. 187-223
  
• Jan Springintveld, Frits W. Vaandrager, Pedro R. D'Argenio:
  Testing timed automata. 225-257
  
• Christophe Raffalli:
  Completeness, minimal logic and programs extraction. 259-271
  
• Salvatore Ruggieri:
  exists-Universal termination of logic programs. 273-296
  
• Rachid Guerraoui, André Schiper:
  Genuine atomic multicast in asynchronous distributed systems. 297-316
  
• Stefano Guerrini, Andrea Masini:
  Parsing MELL proof nets. 317-335
  
• Xiao Jun Chen, Rocco De Nicola:
  Algebraic characterizations of trace and decorated trace equivalences over tree-like structures. 337-361
  
• Jan Van den Bussche:
  Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. 363-377
  
• Lars Jenner, Walter Vogler:
  Fast asynchronous systems in dense time. 379-422
  
• Luc Vandeurzen, Marc Gyssens, Dirk Van Gucht:
  On the expressiveness of linear-constraint query languages for spatial databases. 423-463
  
• Konstantinos F. Sagonas, Terrance Swift, David Scott Warren:
  The limits of fixed-order computation. 465-499
  
• Joost-Pieter Katoen, Christel Baier, Diego Latella:
  Metric semantics for true concurrent real time. 501-542
  
• Marcelo F. Frias, Roger D. Maddux:
  Completeness of a relational calculus for program schemes. 543-556
  
• B. Thomsen, Samson Abramsky:
  A fully abstract denotational semantics for the calculus of higher-order communicating systems. 557-589
  
• Paul Spruit, Roel Wieringa, John-Jules Ch. Meyer:
  Regular database update logics. 591-661
  
• Panos Rondogiannis:
  Stratified negation in temporal logic programming and the cycle-sum test. 663-676
  
• Dieter Probst, Thomas Studer:
  How to normalize the Jay. 677-681
  
• Mark Levene, George Loizou:
  Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. 683-690
  
• Marco Bernardo, Roberto Gorrieri:
  Corrigendum to ``A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time'' - [TCS 202 (1998) 1-54]. 691-694