Multiple parallel transactions in new-type distributed software result in that the events produced by them are randomly ranked. If the tokens of these events are incomplete or unavailable, they can’t be distinguished to belong to which transaction. In this paper, the problem of stripping events with incomplete tokens is converted into maximum-weight perfect matching of bigraph system. If the transition time among these events is independently and identically distributed, all possible states (events) are separated into multiple cutsets, each of them becomes a bigraph system. The improved algorithm of maximum-weight perfect matching is adopted to finish respective matching, and then the matching results are spliced to gain the most possible footprint sequences produced by these transactions. Simulation experiments confirm that our method can effectively strip transaction footprints with incomplete tokens. Compared to traditional bigraph matching algorithm, the improved one has higher efficiency.