Meadow enriched ACP process algebras

We introduce the notion of an ACP process algebra. The models of the axiom system ACP are the origin of this notion. ACP process algebras have to do with processes in which no data are involved. We also introduce the notion of a meadow enriched ACP process algebra, which is a simple generalization of the notion of an ACP process algebra to processes in which data are involved. In meadow enriched ACP process algebras, the mathematical structure for data is a meadow.Comment: 8 pages; correction in Table

An interface group for process components

We take a process component as a pair of an interface and a behaviour. We study the composition of interacting process components in the setting of process algebra. We formalize the interfaces of interacting process components by means of an interface group. An interesting feature of the interface group is that it allows for distinguishing between expectations and promises in interfaces of process components. This distinction comes into play in case components with both client and server behaviour are involved.Comment: 26 pages; section on non-associativity of component composition added, examples adde

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 algebra. We show that, by apposite choice of basic instructions, all processes that can only be in a finite number of states can be produced by single-pass instruction sequences.Comment: 23 pages; acknowledgement corrected, reference update

On the expressiveness of single-pass instruction sequences

We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some execution environment. Threads as considered in basic thread algebra model such behaviours. We show that all regular threads, i.e. threads that can only be in a finite number of states, can be produced by single-pass instruction sequences without jump instructions if use can be made of Boolean registers. We also show that, in the case where goto instructions are used instead of jump instructions, a bound to the number of labels restricts the expressiveness.Comment: 14 pages; error corrected, acknowledgement added; another error corrected, another acknowledgement adde

Programming an interpreter using molecular dynamics

PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting of PGA, which bears on the use of dynamic data structures in programming. We consider the programming of an interpreter for a program notation that is close to existing assembly languages using PGA with the primitives of molecular dynamics as basic instructions. It happens that, although primarily meant for explaining programming language features relating to the use of dynamic data structures, the collection of primitives of molecular dynamics in itself is suited to our programming wants.Comment: 27 page

Transmission protocols for instruction streams

Threads as considered in thread algebra model behaviours to be controlled by some execution environment: upon each action performed by a thread, a reply from its execution environment -- which takes the action as an instruction to be processed -- determines how the thread proceeds. In this paper, we are concerned with the case where the execution environment is remote: we describe and analyse some transmission protocols for passing instructions from a thread to a remote execution environment.Comment: 13 page

Quark masses in QCD: a progress report

Recent progress on QCD sum rule determinations of the light and heavy quark masses is reported. In the light quark sector a major breakthrough has been made recently in connection with the historical systematic uncertainties due to a lack of experimental information on the pseudoscalar resonance spectral functions. It is now possible to suppress this contribution to the 1% level by using suitable integration kernels in Finite Energy QCD sum rules. This allows to determine the up-, down-, and strange-quark masses with an unprecedented precision of some 8-10%. Further reduction of this uncertainty will be possible with improved accuracy in the strong coupling, now the main source of error. In the heavy quark sector, the availability of experimental data in the vector channel, and the use of suitable multipurpose integration kernels allows to increase the accuracy of the charm- and bottom-quarks masses to the 1% level.Comment: Invited review paper to be published in Modern Physics Letters

Process for applying a protective coating for salt bath brazing Patent

Application techniques for protecting materials during salt bath brazin