A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
The Java programming language (2nd ed.)
The Java programming language (2nd ed.)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
C# Concisely
Modular verification of multithreaded programs
Theoretical Computer Science
Formal specification and verification of the C# thread model
Theoretical Computer Science - Formal methods for components and objects
Polarized process algebra and program equivalence
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Strong splitting bisimulation equivalence
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Model theory for process algebra
Processes, Terms and Cycles
A thread algebra with multi-level strategic interleaving
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Splitting bisimulations and retrospective conditions
Information and Computation
A thread calculus with molecular dynamics
Information and Computation
Maurer Computers with Single-Thread Control
Fundamenta Informaticae
Hi-index | 0.00 |
In a previous paper, we developed an algebraic theory about threads and multi-threading based on the assumption that a deterministic interleaving strategy determines how threads are interleaved. The theory includes interleaving operators for a number of plausible deterministic interleaving strategies. The interleaving of different threads 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. In the current paper, we assume that the above-mentioned kind of interleaving is also present at these other levels. We extend the theory developed so far with features to cover the multi-level case. We use the resulting theory to develop a simplified formal representation schema of systems that consist of several multi-threaded programs on various hosts in different networks. We also investigate the connections of the resulting theory with the algebraic theory of processes known as ACP.