Thread Extraction for Polyadic Instruction Sequences

نویسندگان

  • Jan A. Bergstra
  • Kees Middelburg
چکیده

In this paper, we study the phenomenon that instruction sequences are split into fragments which somehow produce a joint behaviour. In order to bring this phenomenon better into the picture, we formalize a simple mechanism by which several instruction sequence fragments can produce a joint behaviour. We also show that, even in the case of this simple mechanism, it is a non-trivial matter to explain by means of a translation into a single instruction sequence what takes place on execution of a collection of instruction sequence fragments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms

We introduce an algebra of instruction sequences by presenting a semigroup C in which programs can be represented without directional bias: in terms of the next instruction to be executed, C has both forward and backward instructions and a C-expression can be interpreted starting from any instruction. We provide equations for thread extraction, i.e., C’s program semantics. Then we consider thre...

متن کامل

Periodic Single-Pass Instruction Sequences

In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs. The resulting mathematical structure is a semigroup. We show that a kernel of this syntax can replace PGA as a carrier for program algebra by providing axioms for defining single-pass congruence an...

متن کامل

An Instruction Sequence Semigroup with Repeaters

In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs. The resulting mathematical structure is a semigroup. We show that a kernel of this syntax can replace PGA as a carrier for program algebra by providing axioms for defining single-pass congruence an...

متن کامل

Instruction sequences for the production of processes

Single-pass instruction sequences under execution are considered to produce behaviours to be controlled by some execution environment. Threads as considered in thread algebra model such behaviours: upon each action performed by a thread, a reply from its execution environment determines how the thread proceeds. Threads in turn can be looked upon as producing processes as considered in process a...

متن کامل

Probabilistic Thread Algebra

We add probabilistic features to basic thread algebra and its extensions with thread-service interaction and strategic interleaving. Here, threads represent the behaviours produced by instruction sequences under execution and services represent the behaviours exhibited by the components of execution environments of instruction sequences. In a paper concerned with probabilistic instruction seque...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Sci. Ann. Comp. Sci.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011