In this chapter, we first present a generalisation of the original trace approach to a framework based on step sequences, where static relationships between actions are captured by relations more involved than independence. We aim at retaining the original philosophy underlying concurrency traces and the resulting framework will be based on just a few explicit and simple design choices. The considerations will lead to the concept of a step alphabet with two basic relations between pairs of different actions, viz. simultaneity signifying that actions may occur together in a step, and sequentialising signifying, e.g., that actions can not occur simultaneously though no specific execution order is required. These two relations are used to identify step sequences as observations of the same concurrent run. The resulting equivalence classes of step sequences are called step traces. We then characterise step traces in terms of the underlying causal structures.