Abstract
Purchase PDF (345 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (5)
Purchase PDF (668 K)
doi:10.1016/j.peva.2003.07.005 
Copyright © 2003 Elsevier B.V. All rights reserved.
Implicit GSPN reachability set generation using decision diagrams
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Andrew S. Miner
Available online 3 October 2003.
Abstract
Implicit techniques for representing and generating the reachability set of a high-level model have become quite efficient. However, such techniques are usually restricted to models whose events have equal priority. Models containing events with differing classes of priority or complex priority structure, in particular models with immediate events, have thus been required to use less-efficient explicit reachability set generation techniques. In this paper, we present an efficient implicit technique, based on multi-valued decision diagram (MDD) representations for sets of states and matrix diagram representations for next-state functions, that can handle models with complex priority structure. We adapt an efficient Kronecker-based reachability set generation algorithm to work with matrix diagrams. If the model contains immediate events, the vanishing states can be eliminated either during generation, by manipulating the matrix diagram, or after generation, by manipulating the MDD. We apply both techniques to several models and give detailed experimental results.
Author Keywords: GSPN reachability; Decision diagrams; Matrix diagrams
