1. Analysis of a class of communicating finite state machines

   • Wuxu Peng
   • S. Purushothaman

   OriginalPaper Pages: 499 - 522

2. An experience in proving regular networks of processes by modular model checking

   • Nicolas Halbwachs
   • Fabienne Lagnier
   • Christophe Ratel

   OriginalPaper Pages: 523 - 543

3. Deterministic sequential functions

   • T. Harju
   • H. C. M. Kleijn
   • M. Latteux

   OriginalPaper Pages: 545 - 554

4. Elementary transition systems and refinement

   • M. Nielsen
   • G. Rozenberg
   • P. S. Thiagarajan

   OriginalPaper Pages: 555 - 578

5. Naive asymptotics for hitting time bounds in Markov chains

   • Vernon Rego

   OriginalPaper Pages: 579 - 594

6. Two impossibility theorems on behaviour specification of abstract data types

   • Oliver Schoett

   OriginalPaper Pages: 595 - 621

7. Classes of systolic Y-tree automata and a comparison with systolic trellis automata

   • E. Fachini
   • A. Maggiolo-Schettini
   • D. Sangiorgi

   OriginalPaper Pages: 623 - 643

8. Expressibility of output equals input

   • Leo Marcus
   • Telis Menas

   OriginalPaper Pages: 645 - 662

9. On the lengths of values in a finite transducer

   • Andreas Weber

   OriginalPaper Pages: 663 - 687