Theoretical Computer Science, Volume 282

Volume 282, Number 1, June 2002

• Joost-Pieter Katoen:
  Real-Time and Probabilistic Systems - Foreword. 1-3
  
• Mario Bravetti, Roberto Gorrieri:
  The theory of interactive generalized semi-Markov processes. 5-32
  
• Bengt Jonsson, Wang Yi:
  Testing preorders for probabilistic processes can be characterized by simulations. 33-51
  
• Paul Z. Kolano:
  Proof assistance for real-time systems using an interactive theorem prover. 53-99
  
• Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
  Automatic verification of real-time systems with discrete probability distributions. 101-150
  
• Karl Lermer, Colin J. Fidge:
  A formal model of real-time program compilation. 151-190
  
• Annabelle McIver:
  Quantitative program logic and expected time bounds in probabilistic distributed algorithms. 191-219
  

Volume 282, Number 2, June 2002

• Elena Lodi, Linda Pagli, Nicola Santoro:
  FUN with Algorithms - Foreword. 221-222
  
• Fabrizio Luccio:
  Algorithms, nymphs, and shepherds. 223-229
  
• David Peleg:
  Local majorities, coalitions and monopolies in graphs: a review. 231-257
  
• Paolo Boldi, Massimo Santini, Sebastiano Vigna:
  Measuring with jugs. 259-270
  
• Aviezri S. Fraenkel:
  Arrays, numeration systems and Frankenstein games. 271-284
  
• Alberto Pedrotti:
  Playing by searching: two strategies against a linearly bounded liar. 285-302
  
• Alon Itai, Michael Rodeh, Hadas Shachnai:
  The passport control problem or how to keep a dynamic service system load balanced? 303-318
  
• Alain Daurat, Yan Gérard, Maurice Nivat:
  The chords' problem. 319-336
  
• Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
  A strip-like tiling algorithm. 337-352
  
• Ronald I. Becker, Bruno Simeone, Yen-I Chiang:
  A shifting algorithm for continuous tree partitioning. 353-380
  
• Steven S. Seiden:
  A manifesto for the computational method. 381-395