For the most recent entries see the Petri Nets Newsletter.

Efficient Reachability Set Generation and Storage Using Decision Diagrams.

Miner, Andrew S.; Ciardo, Gianfranco

In: Donatelli, Susanna; Kleijn, Jetty: Lecture Notes in Computer Science, Vol. 1630: Application and Theory of Petri Nets 1999, 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, pages 6-25. Springer-Verlag, June 1999.

Abstract: We present a new technique for the generation and storage of the reachability set of a Petri net. Our approach is inspired by previous work on Binary and Multi-valued Decision Diagrams but exploits a concept of locality for the effect of a transition's firing to vastly improve algorithmic performance. The result is a data structure and a set of manipulation routines that can be used to generate and store enormous sets extremely efficiently in terms of both memory and execution time.

Keywords: Reachability set generation. System verification. Computer tools..

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

Back to the Petri Nets Bibliography