Anzeige
Erschienen in:
1999 | OriginalPaper | Buchkapitel
Efficient Reachability Set Generation and Storage Using Decision Diagrams
verfasst von : Andrew S. Miner, Gianfranco Ciardo
Erschienen in: Application and Theory of Petri Nets 1999
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.Classiffication: Reachability set generation. System veriffication. Computer tools.