For the most recent entries see the
Petri Nets Newsletter
.
Keyword: polynomial time algorithm
Esparza, Javier
:
A Polynomial Time Algorithm to Solve the Covering Problem for 1-Bounded Conflict-Free Petri Nets.
1991.
Yen, Hsu-Chun
:
A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets.
1991.
Esparza, J.
;
Silva, M.
:
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets.
1989.
Do you need a refined search? Try our
search engine
which allows complex field-based queries.
Back to the Petri Nets Bibliography