𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Hsu-Chun Yen


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
677 KB
Volume
38
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.