The Input/Output Automata formalism of Lynch and Tuttle is a widely used framework for the specification and verification of concurrent algorithms. Unfortunately, it has never been provided with an algebraic characterization, a formalization which has been fundamental for the success of theories like CSP, CCP and ACP.
