Modeling concurrency with interval traces

Interval order structures are useful tools to model abstract concurrent histories, i.e. sets of equivalent system runs, when system runs are modeled with interval orders. This paper shows how interval order structures can be modeled by partially commutative monoids, called interval traces. The model is then used to provide a semantics of Petri nets with inhibitor arcs, both in terms of interval traces and in terms of interval order structures.