Concurrency-Degrees for Jumping Petri-Nets.

Published in Volume XII, 2002, pages 135-

Authors: Cristian VIDRASCU, Toader JUCAN

Abstract

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 autoconcurrency (i.e the case of the transitions concurrently enabled with themselves), thus replacing the old definitions of concurrency-degrees given for jumping Petri nets in \cite{JuV00}, (from \cite{JuV00}), which ignore the auto-concurrency. Also, this paper will introduce a finer notion, namely the concurrency-degrees w.r.t. a set of transitions. Moreover, it will point out how these more general concurrency-degrees can be computed.

Bibtex

@article{sacscuza:vidrascu2002cfjp,
  title={Concurrency-Degrees for Jumping Petri-Nets.},
  author={Cristian VIDRASCU and Toader JUCAN},
  journal={Scientific Annals of Computer Science},
  volume={12},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  year={2002},
  pages={135--},
  publisher={``A.I. Cuza'' University Press}
}