DocumentCode
2176788
Title
Efficient state space generation of GSPNs using decision diagrams
Author
Miner, Andrew S.
Author_Institution
Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
fYear
2002
fDate
2002
Firstpage
637
Lastpage
646
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 explicit reachability set generation techniques. In this paper, we present an efficient implicit technique, based on multi-valued decision diagram representations for sets of states and matrix diagram representations for next-state functions, that can handle models with complex priority structure. 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 multi-valued decision diagram. We apply both techniques to several models and give detailed results.
Keywords
Petri nets; decision diagrams; reachability analysis; state-space methods; stochastic processes; efficient state space generation; explicit reachability set generation techniques; generalized stochastic Petri net; high-level model; immediate events; matrix diagram representations; multi-valued decision diagram representations; next-state functions; priority; vanishing states; Boolean functions; Computer science; Data structures; Electronic mail; Formal verification; Performance analysis; Petri nets; Space technology; State-space methods; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Systems and Networks, 2002. DSN 2002. Proceedings. International Conference on
Print_ISBN
0-7695-1101-5
Type
conf
DOI
10.1109/DSN.2002.1029009
Filename
1029009
Link To Document