A Refined View of the Box Algebra

This paper presents the operational semantics and the Petri net semantics of a fragment of the box algebra in tutorial style. For the operational semantics, inductive rules for marked expressions are given. For the net semantics, a general mechanism of refinement and relabelling is introduced, using which the connectives of the algebra are defined. A companion paper shows how this mechanism can be extended to handle recursion.