Pratt's higher dimensional automata give geometric models for concurrent behaviour of systems, with execution paths appearing as morphisms in associated path categories, suitably defined. Higher dimensional automata are normally studied with topological methods. This talk outlines an alternative combinatorial approach, which is based on easily described higher categories, and which leads to an algorithm and code for computing execution paths in small examples.