Formal Aspects of Computing

, Volume 23, Issue 4, pp 567–583

Thread algebra for poly-threading

Authors

  • J. A. Bergstra
    • Faculty of Science, Informatics InstituteUniversity of Amsterdam
    • Faculty of Science, Informatics InstituteUniversity of Amsterdam
Open AccessArticle

DOI: 10.1007/s00165-011-0178-3

Cite this article as:
Bergstra, J.A. & Middelburg, C.A. Form Asp Comp (2011) 23: 567. doi:10.1007/s00165-011-0178-3

Abstract

It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program behaviours are frequently found. We consider this phenomenon in the setting of thread algebra. We extend basic thread algebra with poly-threading, the barest mechanism for sequencing of threads that are taken for program fragment behaviours. This mechanism is the counterpart of program overlaying at the level of program behaviours. We relate the resulting theory to the process theory known as ACP and use it to describe analytic execution architectures suited for fragmented programs. We also consider the case where the steps of fragmented program behaviours are interleaved in the ways of non-distributed and distributed multi-threading.

Keywords

Poly-threading Thread algebra Process algebra Execution architecture Non-distributed multi-threading Distributed multi-threading

Copyright information

© The Author(s) 2011