A special bialgebra for event logic

I will present an algebraic treatment of "event logic", an influential asynchronous design methodology introduced by Sutherland in 1989. The original presentation is informal and not quite suitable for proving properties of circuits rigourously. In previous work we gave a low-level event model for Event Logic (MFPS 2010) but such a model is unwieldy for many routine calculations. Here we follow a more algebraic approach relying on compact closed categories and bialgebras, applying a methodology which proved remarkably successful in the context of quantum computation. To illustrate the expressiveness and the usefulness of the model we will give several nontrivial examples of simplifying Event Logic circuits.