A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets

  • Authors:

  • Hsu-Chun Yen

  • Affiliations:

  • -

  • Venue:
  • Information Processing Letters
  • Year:
  • 1991

Quantified Score

Hi-index 0.89

Visualization

Abstract