Model directed process traces in a directed cubical framework.
Resource request consists of acquiring/releasing a given resource.
Process trace is Process ID together with valid list of requests.
Attempt to build valid process trace from ID and list of requests.
Attempt to build list of process traces with default process IDs from list of lists of requests.
Modeling contention problems
Given a list of process traces, determine a minimal vertex span suitable for modeling a resource contention problem.
Given a list of process traces, calculate associated list of forbidden regions which represent resource contention. These regions may overlap to form more complex regions.