A Thread Algebra with Multi-Level Strategic Interleaving

Authors:
J. A. Bergstra;C. A. Middelburg
Affiliations:
Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands and Department of Philosophy, Utrecht University, P.O. Box 80126, 3508 TC Utrecht, The Nethe ...;Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands and Computing Science Department, Eindhoven University of Technology, P.O. Box 513, 5600 MB ...
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 4

Distributed strategic interleaving with load balancing

Future Generation Computer Systems
Goto elimination in program algebra

Science of Computer Programming
Instruction Sequences with Dynamically Instantiated Instructions

Fundamenta Informaticae
A thread calculus with molecular dynamics

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.