✦ LIBER ✦

Reachability in Petri Nets with Inhibitor Arcs

✍ Scribed by Klaus Reinhardt

Book ID: 108127037
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 491 KB
Volume: 223
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On persistent reachability in Petri nets

✍ Kamila Barylska; Łukasz Mikulski; Edward Ochmanski 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 343 KB

Distributed semantics for the -calculus

Distributed semantics for the -calculus based on Petri nets with inhibitor arcs

✍ Nadia Busi; Roberto Gorrieri 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Reachability determination in acyclic Pe

Reachability determination in acyclic Petri nets by cell enumeration approach

✍ Duan Li; Xiaoling Sun; Jianjun Gao; Shenshen Gu; Xiaojin Zheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 433 KB

A Sufficient Condition for Reachability

A Sufficient Condition for Reachability in a General Petri Net

✍ Parthasarathy Ramachandran; Manjunath Kamath 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 159 KB

On the reachability and reversibility pr

On the reachability and reversibility problems in a class of Petri nets

✍ Ferrarini, L. 📂 Article 📅 1994 🏛 Institute of Electrical and Electronics Engineers ⚖ 913 KB

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.