Theory of Computing Systems

, Volume 41, Issue 1, pp 3–32 | Cite as

A Thread Algebra with Multi-Level Strategic Interleaving

  • J.A. BergstraEmail author
  • C.A. MiddelburgEmail author
Open Access


In a previous paper we developed an algebraic theory about threads and a form of concurrency where some deterministic interleaving strategy determines how threads that exist concurrently are interleaved. The interleaving of different threads constitutes a multi-thread. Several multi-threads may exist concurrently on a single host in a network, several host behaviours may exist concurrently in a single network on the internet, etc. In the current paper we assume that the above-mentioned kind of interleaving is also present at those other levels. We extend the theory developed so far with features to cover the multi-level case. We employ the resulting theory to develop a simplified, formal representation schema of the design of systems that consist of several multi-threaded programs on various hosts in different networks and to verify a property of all systems designed according to that schema.


Induction Hypothesis Basic Action Local Service Transition Rule Recursion Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer 2007

Authors and Affiliations

  1. 1.Programming Research Group, University of Amsterdam, P.O. Box 418821009 DB AmsterdamThe Netherlands
  2. 2.Department of Philosophy, Utrecht University, P.O. Box 801263508 TC UtrechtThe Netherlands
  3. 3.Computing Science Department, Eindhoven University of Technology, P.O. Box 5135600 MB EindhovenThe Netherlands

Personalised recommendations