Searching for "Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Reachability in Live and Safe Free-Choice Petri Nets is NP-complete
by Javier Esparza — 1996 — Theoretical Computer Science
…Reachability in Live and Safe Free-Choice Petri Nets is NP-complete Javier Esparza Institut fur…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB