Concurrency-Degrees for P/T – Nets.

Published in Volume XIII, 2003, pages 91-104

Authors: Cristian VIDRASCU, Toader JUCAN

Abstract

This paper treats the notion of degrees of concurrency in Petri nets. It will present a more general definition of concurrency-degrees for them, which takes into consideration the autconcurrency (i.e. the case of the transitions concurrently enabled with themselves), thus replacing the old definitions of concurrency-degrees given for P/T-nets in \cite{TJD93}, 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:vidrascu2003cfp-n,
  title={Concurrency-Degrees for P/T - Nets.},
  author={Cristian VIDRASCU and Toader JUCAN},
  journal={Scientific Annals of Computer Science},
  volume={13},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  year={2003},
  pages={91--104},
  publisher={``A.I. Cuza'' University Press}
}