𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition algorithms for live and safe free choice nets

✍ Scribed by Tadaaki Nishimura; Dong-Ik Lee; Shinzo Kodama; Sadatoshi Kumagai

Book ID
112079760
Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
809 KB
Volume
78
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reachability in live and safe free-choic
Reachability in live and safe free-choice Petri nets is NP-complete
✍ 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.

On commoner's liveness theorem and super
On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets
✍ Ramavarapu S. Sreenivas πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 613 KB

A Petri net (PN) (Pe::erson, 1981;Reisig, 1985) is said to be live if it is possible to fire any transition from every reachable marking, although not: necessarily immediately. A free-choice Petri net (FCPN) is a PN, where every arc from a place to a transition is either t~e unique output arc from t