A process algebra for the Span(Graph) model of concurrency

In this note we define a process algebra TCP (Truly Concurrent Processes) which corresponds closely with the automata model of concurrency based on Span(RGraph), the category of spans of reflexive graphs. In TCP, each process has a fixed set of interfaces. Actions are allowed to occur simultaneously on all the interfaces of a process. Asynchrony is modelled by the use of silent actions. Communication is anonymous: communication between two processes P and Q is described by an operation which connects some of the ports of P to some of the ports of Q; and a process can only communicate with other processes via its interfaces. The model is naturally equipped with a compositional semantics in terms of the operations in Span(RGraph) introduced in [5], and developed in [6, 7, 10].

💡 Research Summary

The paper introduces TCP (Truly Concurrent Processes), a process algebra designed to correspond directly with the Span(RGraph) model of concurrency. Span(RGraph) is the category whose objects are spans of reflexive graphs—graphs equipped with self‑loops that naturally capture silent (τ) actions and enable the representation of truly concurrent transitions. TCP adopts this categorical foundation at the syntactic level, providing a language where each process possesses a fixed set of interfaces (ports) and where actions may occur simultaneously on all of those interfaces.

The syntax of TCP includes atomic actions, silent τ‑actions, nondeterministic choice, parallel composition, sequential composition, and a special “connect” operation that links a subset of the ports of one process to a subset of the ports of another. The semantics maps each syntactic construct to an operation in Span(RGraph): parallel composition corresponds to the categorical product of spans, sequential composition to span composition (push‑out), and the connect operation to the gluing of ports via a push‑out that identifies the involved interface edges. Because a span can contain multiple edges that fire together, TCP’s actions are genuinely concurrent rather than interleaved.

Key technical contributions are as follows:

1. Interface‑Centric Design – Every process is a closed entity whose only means of interaction with the environment are its ports. This mirrors the categorical view that a span is a relation between two graphs; the “left” and “right” graphs correspond to the process’s input and output interfaces.

2. True Concurrency via Spans – An action in TCP is a set of simultaneous edge firings across all ports. In Span(RGraph) this is represented by a single span whose source and target graphs each contain the relevant ports and whose middle graph encodes the concurrent transition. Consequently, the algebra respects the independence of concurrent events without resorting to interleaving semantics.

3. Silent Actions as Self‑Loops – τ‑actions are modeled by reflexive edges in the underlying graphs. This provides a clean way to express internal computation, buffering, or asynchronous delay. The presence of τ‑edges also guarantees that every state has at least one outgoing transition, a property useful for defining bisimulation.

4. Anonymous Communication – The connect operation does not name channels; it merely identifies ports. When two processes are connected, the resulting span merges the corresponding interface edges, producing a composite transition that simultaneously updates both processes. This anonymity eliminates the need for explicit name management (as in the π‑calculus) and aligns with the categorical push‑out construction.

5. Compositional Semantics – The paper proves that the algebraic operators satisfy the usual algebraic laws (commutativity and associativity of parallel, identity elements, distributivity of choice over parallel, etc.) by appealing directly to the universal properties of Span(RGraph). For example, the commutativity of parallel composition follows from the symmetry of the product in the category, while associativity follows from the associativity of push‑outs.

6. Expressiveness Demonstrated through Examples – The authors model a simple pipeline, a producer‑consumer system, and an asynchronous message‑passing network. In each case, processes are defined with a small set of ports, internal τ‑actions model buffering or computation, and the connect operation wires the components together. The resulting global system is a single span that captures all possible concurrent executions, illustrating how TCP can serve as a high‑level specification language for real concurrent architectures.

7. Comparison with Existing Algebras – Unlike CCS, CSP, or the π‑calculus, which rely on interleaving semantics or explicit name binding, TCP’s semantics is inherently non‑interleaved and name‑free. This leads to a more direct correspondence between the syntax and the underlying categorical model, simplifying reasoning about true concurrency and making the algebra amenable to categorical tools such as functorial semantics and diagrammatic reasoning.

The paper concludes that TCP provides a mathematically rigorous yet practically expressive framework for specifying and reasoning about concurrent systems. By grounding the language in Span(RGraph), the authors achieve a seamless integration of syntax, semantics, and algebraic laws, opening avenues for formal verification, model transformation, and potential implementation in programming languages that target truly concurrent hardware or distributed environments. Future work is suggested in the direction of developing bisimulation and modal logics tailored to TCP, automated tool support for constructing and analysing spans, and exploring extensions that incorporate quantitative aspects such as timing or probabilistic behavior.