A linear time algorithm solving the legal firing sequence problem for a class of edge-weighted cactuses.

For the most recent entries see the Petri Nets Newsletter.

A linear time algorithm solving the legal firing sequence problem for a class of edge-weighted cactuses.

In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'99), 12-15 October 1999, Tokyo, Japan, Vol. 3, pages 893-898. 1999.

Abstract: The legal firing sequence problem of Petri nets (LFS) is solved in linear time for cyclic cactuses with exactly two kinds of edge weights and for a single transition firings.

Keywords: Petri nets, edge-weighted cactuses, legal firing sequence problem.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography