On concurrency-degrees for jumping Petri nets

This paper treats the notion of degrees of concurrency in jumping Petri nets. It will present a more general definition of concurrency-degrees for them, which takes into consideration the auto-concurrency (i.e the case of the transitions concurrently enabled with themselves), thus replacing the old definitions given in [4], which ignore the auto-concurrency. Also, this paper will introduce a finer notion, namely the concurrency-degrees w.r.t a set of transitions and it will point out how these more general concurrency-degrees can be computed.