Advertisement

A Thread Algebra with Multi-level Strategic Interleaving

  • Jan A. Bergstra
  • C. A. (Kees) Middelburg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)

Abstract

In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on thread vectors. The strategic interleaving of a thread vector constitutes a multi-thread. Several multi-threads may exist concurrently on a single host in a network, several host behaviors may exist concurrently in a single network on the internet, etc. Strategic interleaving is also present at these other levels. In the current paper, we extend the theory developed so far with features to cover multi-level strategic interleaving.

Keywords

Basic Action Local Service Transition Rule Recursion Equation Execution Environment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arnold, K., Gosling, J.: The Java Programming Language. Addison-Wesley, Reading (1996)zbMATHGoogle Scholar
  2. 2.
    Bishop, J., Horspool, N.: C# Concisely. Addison-Wesley, Reading (2004)Google Scholar
  3. 3.
    Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60, 109–137 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bergstra, J.A., Middelburg, C.A.: Thread algebra for strategic interleaving. Computer Science Report 04-35, Department of Mathematics and Computer Science, Eindhoven University of Technology (2004)Google Scholar
  5. 5.
    Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51, 125–156 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bergstra, J.A., Bethke, I.: Polarized process algebra and program equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1–21. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 197–292. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  8. 8.
    Middelburg, C.A.: An alternative formulation of operational conservativity with binding terms. Journal of Logic and Algebraic Programming 55, 1–19 (2003)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jan A. Bergstra
    • 1
    • 2
  • C. A. (Kees) Middelburg
    • 3
  1. 1.Programming Research GroupUniversity of AmsterdamAmsterdamThe Netherlands
  2. 2.Department of PhilosophyUtrecht UniversityUtrechtThe Netherlands
  3. 3.Computing Science DepartmentEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations