1. J.A. Bergstra & C.A. Middelburg.
   Continuity controlled hybrid automata.
   The Journal of Logic and Algebraic Programming, 68(1-2), (2006) 5-53.
   
   
2. J.A. Bergstra & C.A. Middelburg.
   Splitting bisimulations and retrospective conditions.
   Information and Computation, 204(7), (2006) 1083- 1138.
   
   
3. J.A. Bergstra & C.A. Middelburg.
   Thread algebra with multi-level strategies.
   Fundamenta Informaticae, 71(2/3), (2006) 153-182.
   
   
4. J.A. Bergstra & Tucker, J.V.
   Elementary algebraic specifications of the rational complex numbers.
   In K. Futatsugi, J-P. Jouannaud, & J. Messeguer (Eds.), Algebra, Meaning, and Computations (pp. 459-475). Springer-Verlag (2006).
   
   
5. J.A. Bergstra.
   Elementary algebraic specifications of the rational function field.
   In A. Beckmann, U. Berger, B. Loewe, & J.V. Tucker (Eds.), Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings (pp. 40-54). Springer-Verlag.
   
   
6. J.A. Bergstra & A. Ponse
   A bypass of Cohen's impossibility result: Extended version (in html).
   VX Heaven, Library. (2006) (non-refereed)
   
   
7. J.A. Bergstra.
   On the design rationale of ACP based process algebras.
   Electronic Notes in Theoretical Computer Science, 162, (2006) 79-85 (non-refereed)
   
   
8. J.C.M. Baeten & J.A. Bergstra.
   Six Themes for Future Concurrency Research.
   Electronic Notes in Theoretical Computer Science, 162 (2006) 61-64 (non-refereed)
   
   
9. J.A. Bergstra & C.A. Middelburg.
   A thread calculus with molecular dynamics.
   Eindhoven University of Technology, Department of Mathematics and Computing Science. Report CS 06/24 (2006)
   
   
10. J.A. Bergstra & Tucker, J.V.
    Division Safe Calculation in Totalised Fields.
    Amsterdam: Programming Research Group, UvA. Electronic report PRG0605 (2006)
    
    
11. J.A. Bergstra & A. Ponse.
    Interface Groups for Analytic Execution Architectures.
    Amsterdam: Programming Research Group, UvA. Electronic report PRG0601 (2006)
    
    
12. J.A. Bergstra & M. Burgess.
    Local and Global Trust Based on the Concept of Promises.
    Amsterdam: Programming Research Group, UvA. Electronic report PRG0606 (2006)
    
    
13. J.A. Bergstra & C.A. Middelburg.
    Maurer computers for pipelined instruction processing.
    Eindhoven University of Technology, Department of Mathematics and Computing Science. Report CS 06/12 (2006)
    
    
14. J.A. Bergstra & C.A. Middelburg.
    Parallel Processes with Implicit Computational Capital.
    Eindhoven University of Technology, Department of Mathematics and Computing Science. Report 06/35 (2006)
    
    
15. J.A. Bergstra & I. Bethke.
    Predictable and Reliable Program Code: Virtual Machine-based Projection Semantics.
    Amsterdam: Programming Research Group, UvA. Electronic report PRG0603 (2006)
    
    
16. J.A. Bergstra & A. Ponse,
    Program Algebra with Repeat Instruction.
    Amsterdam: Programming Research Group, UvA. Electronic report PRG0602 (2006)
    
    
17. J.A. Bergstra & A. Ponse.
    Projection Semantics for Rigid Loops.
    Amsterdam: Programming Research Group, UvA. Electronic report PRG0604 (2006)
    
    
18. J.A. Bergstra & C.A. Middelburg,
    Synchronous Cooperation for Explicit Multi-Threading.
    Eindhoven University of Technology, Department of Mathematics and Computing Science. Report CS 06/29 (2006)
    
    
19. J.A. Bergstra, I. Bethke & A. Ponse.
    Decision problems for pushdown threads.
    The Bulletin of Symbolic Logic, 12, (2006) 311-312.