This paper is a contribution to the search for efficient and high-level mathematical tools specify reason about (abstract) programming languages or calculi. Generalising reduction monads of Ahrens et al., we introduce transition monads, thus covering new applications such as lambda-bar-mu-calculus, pi-calculus, Positive GSOS specifications, differential lambda-calculus, big-step, simply-typed, ...