๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Reachability of nonsynchronized choice Petri nets and its applications

โœ Scribed by Chao, D.Y.


Book ID
117938426
Publisher
IEEE
Year
2005
Tongue
English
Weight
441 KB
Volume
35
Category
Article
ISSN
1083-4419

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Reachability in live and safe free-choic
โœ Javier Esparza ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 887 KB

The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is polynomial. We show that this is unlikely: the problem is NP-complete.

[Lecture Notes in Computer Science] Appl
โœ Lilius, Johan; Penczek, Wojciech ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 328 KB

This Book Constitutes The Refereed Proceedings Of The 31st International Conference On Applications And Theory Of Petri Nets And Other Models Of Concurrency, Petri Nets 2010, Held In Braga, Portugal, In June 2010. The 16 Revised Papers Classified As Theory Papers (10), Application Papers (2), And To