The goal of this paper is to point out how the minimal coverability structures can be used to compute the superior concurrency-degree of a Petri net.
Some results have been hidden because they may be inaccessible to you
Show inaccessible resultsSome results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback