Computer Science – Logic in Computer Science
Scientific paper
2008-03-04
Formal Aspects of Computing, 23(4):567--583, 2011
Computer Science
Logic in Computer Science
24 pages, sections 9, 10, and 11 are added
Scientific paper
10.1007/s00165-011-0178-3
Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program behaviours are frequently found. In this paper, we consider this phenomenon. We extend basic thread algebra with the barest mechanism for sequencing of threads that are taken for fragments. This mechanism, called poly-threading, supports both autonomous and non-autonomous thread selection in sequencing. We relate the resulting theory to the algebraic theory of processes 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.
Bergstra Jan Aldert
Middelburg C. A.
No associations
LandOfFree
Thread algebra for poly-threading does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Thread algebra for poly-threading, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Thread algebra for poly-threading will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-405922