For the most recent entries see the Petri Nets Newsletter.

A Constructive Method for Finding Legal Transition Sequences in Petri Nets.

Huang, J.S.; Murata, Tadao

In: Journal of Circuits, Systems and Computers, Vol. 8, No. 1, special issue on Selected Topics in Petri nets, pages 189-222. February 1998.

Abstract: This paper considers the Petri net reachability problem formulated in terms of nonnegative integer solutions of the state equation and their net representation systems. Our main contaributions are twofold. First, we show that algorithms for finding legal transition sequences can be easily given for subclasses of Petri nets where reachability criteria are known or can be formulated by the method presented here. Second, for the general reachability problem where reachability theorems or criteria are not known, and thus an exhaustive search for legal transition sequences is inevitable, the notion of non-crucial sequences is introduced to reduce the search effort.


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

Back to the Petri Nets Bibliography