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

Resource

Information Processing Letters 38 (2): 71-76

Journal

Information Processing Letters

Journal Volume

38

Journal Issue

2

Pages

71-76

Date Issued

1991

Date

1991

Author(s)

URI

Type

journal article

File(s)

Name

03.pdf

Size

677.39 KB

Format

Adobe PDF

Checksum

(MD5):a63b0b839b6203430c5334bb20a84092