We show a method for translating concurrent systems into partially ordered sets in a functorial way. This is done in a way resembling the construction of the fundamental groups in topology. Since the morphisms of concurrent systems have a flavour of the implementability of one system in another, the functor provides a tool for proving certain non-implementability results.