The paper shows how transaction management protocols can be designed using discrete-event system control theory. It outlines designs for some well-known protocols : serialization graph testing, two-phase locking, and timestamp ordering. These protocols can be obtained as solutions (centralized, fully decentralized, or maximal decentralized) of standard control problems, The results serve to unify the problems considered and suggest the possibility of computer-aided design.