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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible resultsResults that may be inaccessible to you are currently showing.
Hide inaccessible results