For the most recent entries see the
Petri Nets Newsletter
Keyword: 1-bounded conflict-free net
A Polynomial Time Algorithm to Solve the Covering Problem for 1-Bounded Conflict-Free Petri Nets.
A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets.
Do you need a refined search? Try our
which allows complex field-based queries.
Back to the Petri Nets Bibliography